Results 81 to 90 of about 570,700 (231)
Towards possibilistic fuzzy answer set programming [PDF]
, 2010 Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to ...
Bauters, Kim +4 more
core
Temporal Answer Set Programming on Finite Traces
, 2018 In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces.
Cabalar, Pedro +3 more
core +1 more source
Linear programming method to construct equated item sets for the implementation of periodical computer-based testing for the Korean Medical Licensing Examination [PDF]
Journal of Educational Evaluation for Health Professions, 2018 Purpose This study aimed to identify the best way of developing equivalent item sets and to propose a stable and effective management plan for periodical licensing examinations.
Dong Gi Seo +4 more
doaj +1 more source
Optimizing Phylogenetic Supertrees Using Answer Set Programming
, 2015 The supertree construction problem is about combining several phylogenetic trees with possibly conflicting information into a single tree that has all the leaves of the source trees as its leaves and the relationships between the leaves are as consistent
Janhunen, Tomi +3 more
core +1 more source
Fuzzy Answer Set Programming [PDF]
, 2006 In this paper we show how the concepts of answer set programming and fuzzy logic can be succesfully combined into the single framework of fuzzy answer set programming (FASP). The framework offers the best of both worlds: from the answer set semantics, it inherits the truly declarative non-monotonic reasoning capabilities while, on the other hand, the ...
Vermeir, Dirk +2 more
openaire +3 more sources
Teaching logic programming: a review
CTE Workshop ProceedingsLogic programming constitutes a significant paradigm within computer science, offering a unique approach to programming based on formal logic rather than conventional imperative instructions.
Serhiy O. Semerikov +2 more
doaj +1 more source
Guarded resolution for Answer Set Programming [PDF]
Theory and Practice of Logic Programming, 2010 AbstractWe investigate a proof system based on a guarded resolution rule and show its adequacy for the stable semantics of normal logic programs. As a consequence, we show that Gelfond–Lifschitz operator can be viewed as a proof-theoretic concept. As an application, we find a propositional theory EP whose models are precisely stable models of programs.
Victor W. Marek, Jeffrey B. Remmel
openaire +2 more sources
An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Boolean networks are conventionally used to represent and simulate gene regulatory networks. In the analysis of the dynamic of a Boolean network, the attractors are the objects of a special attention.
Tarek Khaled, Belaïd Benhamou
doaj +1 more source
onlineSPARC: A Programming Environment for Answer Set Programming [PDF]
Theory and Practice of Logic Programming, 2018 AbstractRecent progress in logic programming (e.g. the development of the answer set programming (ASP) paradigm) has made it possible to teach it to general undergraduate and even middle/high school students. Given the limited exposure of these students to computer science, the complexity of downloading, installing, and using tools for writing logic ...
Elias Marcopoulos, Yuanlin Zhang
openaire +2 more sources
Algorithms for Molecular Biology, 2017 Background This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN).
Emna Ben Abdallah +3 more
doaj +1 more source