Super Logic Programs - Institut für Informatik
... (4) In [Stolzenburg and Thomas 1996; 1998] disjunctive logic programming was used for analyzing rule sets for calculating banking fees. A credit institution sells stocks and shares to its customers and charges their accounts. The fee depends on the value of the transaction, the customer type and var ...
... (4) In [Stolzenburg and Thomas 1996; 1998] disjunctive logic programming was used for analyzing rule sets for calculating banking fees. A credit institution sells stocks and shares to its customers and charges their accounts. The fee depends on the value of the transaction, the customer type and var ...
First-Order Intuitionistic Logic with Decidable Propositional
... their subsets”. Propositional logic can be considered a part of the mathematics of finite sets because of availability of finite models using truth tables. Thus, LEM for propositional formulas is not really a target of intuitionistic criticism of classical logic. The classical assumption that every ...
... their subsets”. Propositional logic can be considered a part of the mathematics of finite sets because of availability of finite models using truth tables. Thus, LEM for propositional formulas is not really a target of intuitionistic criticism of classical logic. The classical assumption that every ...
Expressiveness of Logic Programs under the General Stable Model
... the original semantics to arbitrary structures, was then proposed via second-order logic [Ferraris et al. 2011], via circumscription [Lin and Zhou 2011], and via Gödel’s 3-valued logic [Pearce and Valverde 2005], respectively, which provides us a unified framework for answer set programming, armed ...
... the original semantics to arbitrary structures, was then proposed via second-order logic [Ferraris et al. 2011], via circumscription [Lin and Zhou 2011], and via Gödel’s 3-valued logic [Pearce and Valverde 2005], respectively, which provides us a unified framework for answer set programming, armed ...
TEMPORAL LOGIC
... University of Dortmund, Department of Computer Science Symbolic logic generally supports the reasoning with propositions, i.e., with statements to be evaluated to true or false. Temporal logic is a special branch of symbolic logic focussing on propositions whose truth values depend on time. That con ...
... University of Dortmund, Department of Computer Science Symbolic logic generally supports the reasoning with propositions, i.e., with statements to be evaluated to true or false. Temporal logic is a special branch of symbolic logic focussing on propositions whose truth values depend on time. That con ...
Quantitatively Evaluating Formula-Variable Relevance by
... The underlying intuition is: if the model set of ForgetVar(ψ, p) remains unchanged or little changed comparing to the model set of ψ, it means that p is already or almost “forgotten” in ψ, and ψ contains models in which p is true and almost the same amount of models in which p is f alse (and these m ...
... The underlying intuition is: if the model set of ForgetVar(ψ, p) remains unchanged or little changed comparing to the model set of ψ, it means that p is already or almost “forgotten” in ψ, and ψ contains models in which p is true and almost the same amount of models in which p is f alse (and these m ...
AAAI Proceedings Template
... our current projects build on the XSB [Sagonas, et al, 2000] deductive database. XSB has several virtues which include its impressive speed in performing deductions in large knowledge bases which may have long inference chains. As we discuss below, XSB Prolog is, however, a rather basic language for ...
... our current projects build on the XSB [Sagonas, et al, 2000] deductive database. XSB has several virtues which include its impressive speed in performing deductions in large knowledge bases which may have long inference chains. As we discuss below, XSB Prolog is, however, a rather basic language for ...
Negation Without Negation in Probabilistic Logic Programming
... (probabilistic) rule has the form p : head ← body, where p is a probability, head is a positive literal, and body is a conjunction of other, positive or negative, literals. When p = 1, it can be omitted, and the rule is called a deterministic rule. The probabilistic aspect is captured using a set of ...
... (probabilistic) rule has the form p : head ← body, where p is a probability, head is a positive literal, and body is a conjunction of other, positive or negative, literals. When p = 1, it can be omitted, and the rule is called a deterministic rule. The probabilistic aspect is captured using a set of ...
Extending Logic Programs with Description Logic Expressions for
... - q; c ⊓ ¬b](a). This dl-atom queries L if a is in the concept c but not in the concept b, given the mapping that for any x, if p(x) is true then x is in c and if q(x) is false then x is not in b. As an interface-based extension, DL-programs require predicate symbols in Π be disjoint from predicate ...
... - q; c ⊓ ¬b](a). This dl-atom queries L if a is in the concept c but not in the concept b, given the mapping that for any x, if p(x) is true then x is in c and if q(x) is false then x is not in b. As an interface-based extension, DL-programs require predicate symbols in Π be disjoint from predicate ...
Here`s the beef: Answer Set Programming
... See also http://en.wikipedia.org/wiki/Where’s_the_beef Logic Programming under Stable Model Semantics turned out to be a special case of Default Logic, with stable models corresponding to default extensions [6, 7]. See also http://www.kr.tuwien.ac.at/research/projects/WASP/ report.html ...
... See also http://en.wikipedia.org/wiki/Where’s_the_beef Logic Programming under Stable Model Semantics turned out to be a special case of Default Logic, with stable models corresponding to default extensions [6, 7]. See also http://www.kr.tuwien.ac.at/research/projects/WASP/ report.html ...
A Well-Founded Semantics for Logic Programs with Abstract
... A classical model M of a basic positive program P is an answer set of P if M is the least fixpoint of T(P,M ) , i.e., M = lfp(T(P,M ) ). There are two different answer set semantics for basic logic programs. One is defined by reduct, and the other is by complement. Formally, let P be a basic logic p ...
... A classical model M of a basic positive program P is an answer set of P if M is the least fixpoint of T(P,M ) , i.e., M = lfp(T(P,M ) ). There are two different answer set semantics for basic logic programs. One is defined by reduct, and the other is by complement. Formally, let P be a basic logic p ...
How complicated is the set of stable models of a recursive logic
... FP,M . In order to understand this fixpoint in the context of the models of the program P , recall the operational construction of a stable model of a logic program from ([Gelfond and Lifschitz, 1988]). Given program P and M ⊆ BP , first define the Gelfond-Lifschitz reduct of P as follows. For every ...
... FP,M . In order to understand this fixpoint in the context of the models of the program P , recall the operational construction of a stable model of a logic program from ([Gelfond and Lifschitz, 1988]). Given program P and M ⊆ BP , first define the Gelfond-Lifschitz reduct of P as follows. For every ...
Lparse Programs Revisited: Semantics and Representation of
... Despite of being one of the most popular systems, the semantics of lparse programs has not been fully studied. In [11], it is shown that lparse programs can be transformed to logic programs with monotone weight constraints while preserving the lparse semantics. Based on this result, in [10] weight c ...
... Despite of being one of the most popular systems, the semantics of lparse programs has not been fully studied. In [11], it is shown that lparse programs can be transformed to logic programs with monotone weight constraints while preserving the lparse semantics. Based on this result, in [10] weight c ...
Semantics for Possibilistic Disjunctive Programs
... likelihood of uncertain events. In fact, we commonly use statements such as “I think that . . . ”, “chances are . . . ”, “it is probable that . . . ”, “it is plausible that . . . ”, etc., for supporting our decisions. In this kind of statements usually we have appealed to our experience or our commo ...
... likelihood of uncertain events. In fact, we commonly use statements such as “I think that . . . ”, “chances are . . . ”, “it is probable that . . . ”, “it is plausible that . . . ”, etc., for supporting our decisions. In this kind of statements usually we have appealed to our experience or our commo ...
Logic Programming for Knowledge Representation
... A basic design principle in knowledge representation is the principle of modularity. It stipulates that knowledge bases be composed of modules, each representing a fragment of an application domain being modeled. The principle of modularity gave rise to research problems that have generated much int ...
... A basic design principle in knowledge representation is the principle of modularity. It stipulates that knowledge bases be composed of modules, each representing a fragment of an application domain being modeled. The principle of modularity gave rise to research problems that have generated much int ...
Partial Grounded Fixpoints
... L are sets of “facts” and the ≤ relation is the subset relation between such sets. In this case, a point (x, y) ∈ Lc represents a partial set of “facts”: the elements of x are the facts that certainly belong to the partial set, the elements in y are those that possibly belong to the set. Thus, y \ x ...
... L are sets of “facts” and the ≤ relation is the subset relation between such sets. In this case, a point (x, y) ∈ Lc represents a partial set of “facts”: the elements of x are the facts that certainly belong to the partial set, the elements in y are those that possibly belong to the set. Thus, y \ x ...
GLukG logic and its application for non-monotonic reasoning
... such that the following properties hold? 1. The logic should have the following desirable properties. It should satisfy the replacement and deduction theorems. It should be expressive enough. If possible it should be finitely axiomatizable and somehow close to some constructive logic. If possible th ...
... such that the following properties hold? 1. The logic should have the following desirable properties. It should satisfy the replacement and deduction theorems. It should be expressive enough. If possible it should be finitely axiomatizable and somehow close to some constructive logic. If possible th ...
On the Notion of Coherence in Fuzzy Answer Set Semantics
... generalization of the Gelfond-Lifschitz reduct. As our interest in this work is on the notion of coherence, our natural environment is that of extended residuated logic programs, that is, those which do not contain default negation. Note that, as our interpretations are defined on the set of literal ...
... generalization of the Gelfond-Lifschitz reduct. As our interest in this work is on the notion of coherence, our natural environment is that of extended residuated logic programs, that is, those which do not contain default negation. Note that, as our interpretations are defined on the set of literal ...
Parameterized Splitting: A Simple Modification
... 2. deleting all negated atoms from the remaining rules. S is an answer set of P iff S is the answer set of P S . We denote the collection of answer sets of a program P by AS (P ). For convenience we will use rules without head (constraints) of the form ← b1 , . . . , bm , not c1 , . . . , not cn ...
... 2. deleting all negated atoms from the remaining rules. S is an answer set of P iff S is the answer set of P S . We denote the collection of answer sets of a program P by AS (P ). For convenience we will use rules without head (constraints) of the form ← b1 , . . . , bm , not c1 , . . . , not cn ...
Foundations of Logic Programmin:
... intelligence. Building on work of Herbrand [44] in 1930, there was much activity in theorem proving in the early 1960's by Prawitz 184], Gilmtire [39], Davis, Putnam [26] and others. This effort culminated in 1965 with the publication of the landmark paper by Robinson [88], which introduced the reso ...
... intelligence. Building on work of Herbrand [44] in 1930, there was much activity in theorem proving in the early 1960's by Prawitz 184], Gilmtire [39], Davis, Putnam [26] and others. This effort culminated in 1965 with the publication of the landmark paper by Robinson [88], which introduced the reso ...
How an Agent Might Think
... • substantially relaxing the requirements concerning the layered architecture. These syntactic changes are accompanied by new definitions of semantics. We have also provided a new PT IME algorithm for computing well-supported models and working with such syntactic extensions. Let us emphasize that t ...
... • substantially relaxing the requirements concerning the layered architecture. These syntactic changes are accompanied by new definitions of semantics. We have also provided a new PT IME algorithm for computing well-supported models and working with such syntactic extensions. Let us emphasize that t ...
ANNALS OF PURE AND APPLIED LOGIC I W
... Unlike PL and its descendants, RPL and R, we have decided not to include the modal operators [ ] and ( ) in CPL. The reason is as follows. Consider a PLIRPL!R formula of the form [m]cp, where CI is a program and 40 is a path property. While one might expect this formula to be true on all cc-paths th ...
... Unlike PL and its descendants, RPL and R, we have decided not to include the modal operators [ ] and ( ) in CPL. The reason is as follows. Consider a PLIRPL!R formula of the form [m]cp, where CI is a program and 40 is a path property. While one might expect this formula to be true on all cc-paths th ...
Bounded LTL Model Checking with Stable Models∗
... (Deadlock detection) Given a 1-safe P/T-net Σ, is there a reachable marking M which does not enable any transition of Σ? Most analysis questions including deadlock detection and LTL model checking are PSPACE-complete in the size of a 1-safe Petri net, see e.g., (Esp98). In bounded model checking we ...
... (Deadlock detection) Given a 1-safe P/T-net Σ, is there a reachable marking M which does not enable any transition of Σ? Most analysis questions including deadlock detection and LTL model checking are PSPACE-complete in the size of a 1-safe Petri net, see e.g., (Esp98). In bounded model checking we ...
From Answer Set Logic Programming to Circumscription via Logic of
... Answer Set Programming (ASP) is a new paradigm of constraint-based programming based on logic programming with answer set semantics 17,9,13]. It started out with normal logic programs, which are programs that can have negation but not disjunction. Driven by the need of applications, various extensi ...
... Answer Set Programming (ASP) is a new paradigm of constraint-based programming based on logic programming with answer set semantics 17,9,13]. It started out with normal logic programs, which are programs that can have negation but not disjunction. Driven by the need of applications, various extensi ...
Grounding and Solving in Answer Set Programming
... r is found and the process continues by backtracking again to some previous literal, in order to find other substitutions. A crucial aspect of this process is how the set of ground atoms S containing the extensions of the predicates is computed. When a program is given as input to a grounder, it us ...
... r is found and the process continues by backtracking again to some previous literal, in order to find other substitutions. A crucial aspect of this process is how the set of ground atoms S containing the extensions of the predicates is computed. When a program is given as input to a grounder, it us ...
7. Propositional Logic Rational Thinking, Logic, Resolution
... In order to implement the process, a strategy must be developed to determine which resolution steps will be executed and when. In the worst case, a resolution proof can take exponential time. This, however, very probably holds for all other proof procedures. For CNF formulae in propositional logic, ...
... In order to implement the process, a strategy must be developed to determine which resolution steps will be executed and when. In the worst case, a resolution proof can take exponential time. This, however, very probably holds for all other proof procedures. For CNF formulae in propositional logic, ...