In the past, there have been several attempts to explain logicprogramming under the well-founded semantics as a logic of inductive definitions. A weakness in all is the absence of an obvious connection between how we...
详细信息
In the past, there have been several attempts to explain logicprogramming under the well-founded semantics as a logic of inductive definitions. A weakness in all is the absence of an obvious connection between how we understand various types of informal inductive definitions in mathematical text and the complex mathematics of the well-founded semantics. In this paper, we close this gap. We formalize the induction process in the most common principles and prove that the well-founded model construction generalizes them all.
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logic Programmin...
详细信息
ISBN:
(纸本)3540632557
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logicprogramming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz since July 1995.
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than o...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than or equal to, boolean OR, boolean AND, double right arrow, 0, 1). A graded strong literal disjunction is a pair (D, c) where D is a strong literal disjunction of the form l(1)(V) over dot ... (V) over dot l(n) and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.
Nonmonotonic causal logic, invented by McCain and Turner, is a formalism well suited for representing knowledge about actions, and the definite fragment of that formalism has been implemented in the reasoning and plan...
详细信息
Nonmonotonic causal logic, invented by McCain and Turner, is a formalism well suited for representing knowledge about actions, and the definite fragment of that formalism has been implemented in the reasoning and planning system called CCalc. A 1997 theorem due to McCain shows how to translate definite causal theories into logicprogramming under the answer set semantics, and thus opens the possibility of using answer set programming for the implementation of such theories. In this paper we propose a generalization of McCain's theorem that extends it in two directions. First, it is applicable to arbitrary causal theories, not only definite. Second, it covers causal theories of a more general kind, which can describe non-Boolean fluents.
In this note we discuss the expressive power of mu-calculi. We concentrate on those that are extensions of propositional modal logics with a fixpoint operator. the objective is to try to match the expressive power of ...
详细信息
ISBN:
(纸本)3540252363
In this note we discuss the expressive power of mu-calculi. We concentrate on those that are extensions of propositional modal logics with a fixpoint operator. the objective is to try to match the expressive power of monadic second-order logic. We consider different kinds of models: from trees and transition systems tip to traces and timed systems.
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. the idea is to define a decidable subset of many-sorted (typed) first- order logic. ...
详细信息
ISBN:
(纸本)9783540755586
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. the idea is to define a decidable subset of many-sorted (typed) first- order logic. the motivation is that types simplify the complexity of mixed quantifiers when they quantify over different types. We noticed that many real world verification problems can be formalized by quantifying over different types in such a way that the relations between types remain simple. Our main result is a decidable fragment of many-sorted first-order logicthat captures many real world specifications.
We present a new method for solving problems in intuitionistic propositional logic, which involves the use of an incremental SAT-solver. the method scales to very large problems, and fits well into an SMT-based framew...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
We present a new method for solving problems in intuitionistic propositional logic, which involves the use of an incremental SAT-solver. the method scales to very large problems, and fits well into an SMT-based framework for interaction with other theories.
We introduce the first approach to Reactive Answer Set programming, aiming at reasoning about real-time dynamic systems running online in changing environments. We start by laying the theoretical foundations by appeal...
详细信息
ISBN:
(纸本)9783642208942
We introduce the first approach to Reactive Answer Set programming, aiming at reasoning about real-time dynamic systems running online in changing environments. We start by laying the theoretical foundations by appeal to module theory. Withthis, we elaborate upon the composition of the various offline and online programs in order to pave the way for stream-driven grounding and solving. Finally, we describe the implementation of a reactive ASP solver, oclingo.
暂无评论