D
David Pearce
Researcher at Technical University of Madrid
Publications - 125
Citations - 2878
David Pearce is an academic researcher from Technical University of Madrid. The author has contributed to research in topics: Intermediate logic & Stable model semantics. The author has an hindex of 26, co-authored 117 publications receiving 2737 citations. Previous affiliations of David Pearce include Free University of Berlin & German Research Centre for Artificial Intelligence.
Papers
More filters
Journal ArticleDOI
Strongly equivalent logic programs
TL;DR: The main theorem shows that the verification of strong equivalence can be accomplished by cheching the equivalence of formulas in a monotonic logic, called the logic of here-and-there, which is intermediate between classical logic and intuitionistic logic.
Book ChapterDOI
A New Logical Characterisation of Stable Models and Answer Sets
TL;DR: This paper relates inference in extended logic programming with nonclassical, nonmonotonic logics with equilibrium logic, and shows that on logic programs equilibrium logic coincides with the inference operation associated with the stable model and answer set semantics of Gelfond and Lifschitz.
Journal ArticleDOI
Equilibrium logic
TL;DR: This work presents an overview of equilibrium logic and its main properties and uses and states it provides a logical foundation for ASP as an extension of the basic syntax of answer set programs.
Journal ArticleDOI
Stable inference as intuitionistic validity
TL;DR: The paper characterises the nonmonotonic inference relation associated with the stable model semantics for logic programs as follows: a formula is entailed by a program in the stablemodel semantics if and only if it belongs to every intuitionistically complete and consistent extension of the program formed by adding only negated atoms.
Book ChapterDOI
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
TL;DR: The method to implement equilibrium logic and stable models for logic programs with nested expressions, based on polynomial reductions to quantified Boolean formulas (QBFs), yields a practically relevant approach to rapid prototyping.