Results 1  10
of
19
A New Logical Characterisation of Stable Models and Answer Sets
 In Proc. of NMELP 96, LNCS 1216
, 1997
"... This paper relates inference in extended logic programming with nonclassical, nonmonotonic logics. We define a nonmonotonic logic, called equilibrium logic, based on the least constructive extension, N2, of the intermediate logic of "hereandthere". We show that on logic programs equilib ..."
Abstract

Cited by 45 (11 self)
 Add to MetaCart
This paper relates inference in extended logic programming with nonclassical, nonmonotonic logics. We define a nonmonotonic logic, called equilibrium logic, based on the least constructive extension, N2, of the intermediate logic of "hereandthere". We show that on logic programs equilibrium logic coincides with the inference operation associated with the stable model and answer set semantics of Gelfond and Lifschitz. We thereby obtain a very simple characterisation of answer set semantics as a form of minimal model reasoning in N2, while equilibrium logic itself provides a natural generalisation of this semantics to arbitrary theories. We discuss briefly some consequences and applications of this result. 1 Introduction By contrast with the minimal model style of reasoning characteristic of several approaches to the semantics of logic programs, the stable model semantics of Gelfond and Lifschitz [8] was, from the outset, much closer in spirit to the styles of reasoning found in othe...
Updates in answer set programming: An approach based on basic structural properties. Theory and Practice of Logic Programming 7
, 2007
"... We have studied the update operator ⊕1 defined for update sequences by Eiter et al. without tautologies and we have observed that it satisfies an interesting property 1. This property, which we call Weak Independence of Syntax (WIS), is similar to one of the postulates proposed by Alchourrón, Gärden ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We have studied the update operator ⊕1 defined for update sequences by Eiter et al. without tautologies and we have observed that it satisfies an interesting property 1. This property, which we call Weak Independence of Syntax (WIS), is similar to one of the postulates proposed by Alchourrón, Gärdenfors, and Makinson (AGM); only that in this case it applies to nonmonotonic logic. In addition, we consider other five additional basic properties about update programs and we show that⊕1 satisfies them. This work continues the analysis of the AGM postulates with respect to the⊕1 operator under a refined view that considers N2 as a monotonic logic which allows us to expand our understanding of answer sets. Moreover, N2 helped us to derive an alternative definition of⊕1 avoiding the use of unnecessary extra atoms.
Diamonds are a Philosopher's Best Friends. The Knowability Paradox and Modal Epistemic Relevance Logic (Extended Abstract)
 Journal of Philosophical Logic
, 2002
"... Heinrich Wansing Dresden University of Technology The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Heinrich Wansing Dresden University of Technology The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is derived that all truths are, in fact, known. Nevertheless, the solution o#ered is in the spirit of the constructivist attitude usually maintained by defenders of the antirealist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete.
Characterising equilibrium logic and nested logic programs: Reductions and complexity
, 2009
"... Equilibrium logic is an approach to nonmonotonic reasoning that extends the stablemodel and answerset semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kind ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stablemodel and answerset semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into quantified propositional logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted. Thus, quantified propositional logic is a fragment of secondorder logic, and its formulas are usually referred to as quantified Boolean formulas (QBFs). We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some QBF such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are the consistency problem, brave reasoning, and skeptical reasoning. Additionally, we also provide encodings for testing equivalence of theories or programs under different notions
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report ⋆
"... Abstract. For a given semantics, two nonmonotonic theories Π1 and Π2 can be said to be equivalent if they have the same intended models and strongly (resp., uniformly) equivalent if for any Σ, Π1∪Σ and Π2∪Σ are equivalent, where Σ is a set of sentences (resp., literals). In the general case, no rest ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. For a given semantics, two nonmonotonic theories Π1 and Π2 can be said to be equivalent if they have the same intended models and strongly (resp., uniformly) equivalent if for any Σ, Π1∪Σ and Π2∪Σ are equivalent, where Σ is a set of sentences (resp., literals). In the general case, no restrictions are placed on the language (signature) of Σ. Relativised notions of strong and uniform equivalence are obtained by requiring that Σ belongs to a specified sublanguage L of the theories Π1 and Π2. For normal and disjunctive logic programs under stablemodel semantics, relativised strong and uniform equivalence have been defined and characterised in previous work by Woltran. Here, we extend these concepts to nonmonotonic theories in equilibrium logic and discuss applications in the context of prediction and explanation. 1
Paraconsistent Description Logics Revisited
"... Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistencytolerant) description logics have been studied by several researchers to cope with such inconsistencies. In this paper, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistencytolerant) description logics have been studied by several researchers to cope with such inconsistencies. In this paper, a new paraconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraconsistent negation. Some theorems for embedding PALC into ACL are proved, and PALC is shown to be decidable. A tableau calculus for PALC is introduced, and the completeness theorem for this calculus is proved. 1
Implicit Programming and the Logic of Constructible Duality
, 1998
"... We present an investigation of duality in the traditional logical manner. We extend Nelson's symmetrization of intuitionistic logic, constructible falsity, to a selfdual logic constructible duality. We develop a selfdual model by considering an interval of worlds in an intuitionistic Kripk ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present an investigation of duality in the traditional logical manner. We extend Nelson's symmetrization of intuitionistic logic, constructible falsity, to a selfdual logic constructible duality. We develop a selfdual model by considering an interval of worlds in an intuitionistic Kripke model. The duality arises through how we judge truth and falsity. Truth is judged forward in the Kripke model, as in intuitionistic logic, while falsity is judged backwards. We develop a selfdual algebra such that every point in the algebra is representable by some formula in the logic. This algebra arises as an instantiation of a Heyting algebra into several categorical constructions. In particular, we show that this algebra is an instantiation of the Chu construction applied to a Heyting algebra, the second Dialectica construction applied to a Heyting algebra, and as an algebra for the study of recursion and corecursion. Thus the algebra provides a common base for these constructions, and suggests itself as an important part of any constructive logical treatment of duality. Implicit programming is suggested as a new paradigm for computing with constructible duality as its formal system. We show that all the operators that have computable least fixed points are definable explicitly and all operators with computable optimal fixed points are definable implicitly within constructible duality. Implicit programming adds a novel definitional mechanism that allows functions to be defined implicitly. This new programming feature is especially useful for programming with corecursively defined datatypes such as circular lists.
D.: Assumption sets for extended logic programs
 JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday
, 1999
"... ..."
Kripke Completeness of FirstOrder Constructive Logics with Strong Negation
, 2003
"... This paper considers Kripke completeness of Nelson's constructive predicate logic N and its several variants. N is an extension of intuitionistic predicate logic Int by an contructive negation operator called strong negation. The variants of N in consideration are by the axiom of constant dom ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper considers Kripke completeness of Nelson's constructive predicate logic N and its several variants. N is an extension of intuitionistic predicate logic Int by an contructive negation operator called strong negation. The variants of N in consideration are by the axiom of constant domain 8x(A(x)B) ! 8xA(x)B, the axiom (A ! B)(B ! A), omitting the axiom A ! (A ! B) and the axiom ::(AA); the last one we would like to call the axiom of potential omniscience and can be interpreted that we can always verify or falsify a statement, with proper additional information. The proofs
Back and Forth Semantics for Normal, Disjunctive and Extended Logic Programs
 In Proceedings of the Joint Conference on Declarative Programming (APPIAGULPPRODE'98
, 1998
"... We define a logical semantics called backandforth, applicable to normal and disjunctive datalog programs as well as to programs possessing a second, explicit or `strong' negation operator. We show that on normal programs it is equivalent to the wellfounded semantics (WFS), and that on disjun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define a logical semantics called backandforth, applicable to normal and disjunctive datalog programs as well as to programs possessing a second, explicit or `strong' negation operator. We show that on normal programs it is equivalent to the wellfounded semantics (WFS), and that on disjunctive programs it is equivalent to the Pstable semantics of Eiter, Leone and Sacc`a, hence to Przymusinski's 3valued stable semantics. The main advantage is that it is characterised by simple conditions on models in a wellknown nonclassical logic and therefore provides a better insight into the nature of partial stable models from a logical standpoint. It also suggests why the Pstable models are a natural generalisation of WFS to the disjunctive case. On extended programs with strong negation, the backandforth semantics is apparently new, differing from answer sets, from WSFX and from the static semantics. Keywords: stable models, Pstable models, disjunctive programs, intermediate logics,...