Synonymous theories and knowledge representations in answer set programming

[1]  Randall Davis,et al.  Knowledge representation , 2019, The Information System Consultant’s Handbook.

[2]  Joohyung Lee,et al.  System f2lp - Computing Answer Sets of First-Order Formulas , 2009, LPNMR.

[3]  David Pearce,et al.  Quantified Equilibrium Logic and Foundations for Answer Set Programs , 2008, ICLP.

[4]  Pedro Cabalar,et al.  Partial Functions and Equality in Answer Set Programming , 2008, ICLP.

[5]  Joohyung Lee,et al.  Safe Formulas in the General Theory of Stable Models (Preliminary Report) , 2008, ICLP.

[6]  Giovambattista Ianni,et al.  Computable Functions in ASP: Theory and Implementation , 2008, ICLP.

[7]  Fangzhen Lin,et al.  Answer Set Programming with Functions , 2008, KR.

[8]  Joohyung Lee,et al.  A Reductive Semantics for Counting and Choice in Answer Set Programming , 2008, AAAI.

[9]  S. Kanger.  Measurement: An essay in philosophy of science1 , 2008 .

[10]  Thomas Eiter,et al.  \mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols , 2007, LPAR.

[11]  Jos de Bruijn,et al.  Quantified Equilibrium Logic and Hybrid Rules , 2007, RR.

[12]  David Pearce,et al.  A Characterization of Strong Equivalence for Logic Programs with Variables , 2007, LPNMR.

[13]  Joohyung Lee,et al.  A New Perspective on Stable Models , 2007, IJCAI.

[14]  Stefan Woltran,et al.  An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs , 2006, JELIA.

[15]  David Pearce,et al.  Equilibrium logic , 2006, Annals of Mathematics and Artificial Intelligence.

[16]  Stijn Heymans,et al.  Open answer set programming with guarded programs , 2006, TOCL.

[17]  David Pearce,et al.  A First Order Nonmonotonic Extension of Constructive Logic , 2005, Stud Logica.

[18]  Stefan Woltran,et al.  On Solution Correspondences in Answer-Set Programming , 2005, IJCAI.

[19]  D. Gabbay,et al.  Interpolation and Definability: Modal and Intuitionistic Logic , 2005 .

[20]  D. Gabbay,et al.  Interpolation and Definability in Modal Logics (Oxford Logic Guides) , 2005 .

[21]  David Pearce,et al.  Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning , 2004, JELIA.

[22]  David Pearce,et al.  Synonymus Theories in Answer Set Programming and Equilibrium Logic , 2004, ECAI.

[23]  Stefan Woltran,et al.  On Eliminating Disjunctions in Stable Logic Programming , 2004, KR.

[24]  Stefan Woltran,et al.  Simplifying Logic Programs Under Uniform and Strong Equivalence , 2004, LPNMR.

[25]  David Pearce,et al.  Uniform Equivalence for Equilibrium Logic and Logic Programs , 2004, LPNMR.

[26]  H. Turner,et al.  Strong Equivalence for Causal Theories , 2004, LPNMR.

[27]  Thomas Eiter,et al.  Efficient Evaluation of Logic Programs for Querying Data Integration Systems , 2003, ICLP.

[28]  Vladimir Lifschitz,et al.  Definitions in Answer Set Programming: (Extended Abstract) , 2003, ICLP.

[29]  M. Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory and Practice of Logic Programming.

[30]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[31]  Lex Hendriks,et al.  Characterization of strongly equivalent logic programs in intermediate logics , 2002, Theory and Practice of Logic Programming.

[32]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[33]  Michael Gelfond,et al.  The USA-Advisor: A Case Study in Answer Set Planning , 2001, LPNMR.

[34]  Hudson Turner,et al.  Strong Equivalence for Logic Programs and Default Theories (Made Easy) , 2001, LPNMR.

[35]  Larisa Maksimova,et al.  Intuitionistic logic and implicit definability , 2000, Ann. Pure Appl. Log..

[36]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[37]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

[38]  Vladimir Lifschitz,et al.  Missionaries and Cannibals in the Causal Calculator , 2000, KR.

[39]  Tomi Janhunen,et al.  On the intertranslatability of non‐monotonic logics , 1999, Annals of Mathematics and Artificial Intelligence.

[40]  L. L. Maksimova,et al.  Interpolation in superintuitionistic predicate logics with equality , 1997 .

[41]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[42]  David Pearce,et al.  Roads to Commensurability , 1987 .

[43]  Veikko Rantala,et al.  New foundations for metascience , 1983, Synthese.

[44]  T. Hosoi.  The axiomatization of the intermediate propositional systems $S_2$ of Godel , 1966 .

[45]  Thomas Eiter,et al.  FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols , 2010, TOCL.

[46]  Pedro Cabalar.  Existential Quantifiers in the Rule Body , 2009 .

[47]  Under consideration for publication in Theory and Practice of Logic Programming 1 Weight Constraints as Nested Expressions , 2003 .

[48]  Francesco Calimeri,et al.  Enhancing Disjunctive Logic Programming for Ontology Specification , 2003, APPIA-GULP-PRODE.

[49]  Chitta Baral.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[50]  Davy Van Nieuwenborgh,et al.  G-Hybrid Knowledge Bases , 2003 .

[51]  Larisa Maksimova,et al.  Interpolation in Superintuitionistic and Modal Predicate Logics with Equality , 1996, Advances in Modal Logic.

[52]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[53]  CHARLES C. PINTER,et al.  Properties Preserved under Definitional Equivalence and Interpretations , 1978, Math. Log. Q..

[54]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[55]  Li-Yan Yuan,et al.  Under consideration for publication in Theory and Practice of Logic Programming 1 Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms , 2022 .