Reducing Propositional Theories in Equilibrium Logic to Logic Programs

The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity constraints on this process. We want the transformed program to be equivalent in a strong sense so that theory parts can be transformed independent of the wider context in which they might be embedded. It was only recently established [1] that propositional theories are indeed equivalent (in a strong sense) to logic programs. Here this result is extended with the following contributions. (i) We show how to effectively obtain an equivalent program starting from an arbitrary theory. (ii) We show that in general there is no polynomial time transformation if we require the resulting program to share precisely the vocabulary or signature of the initial theory. (iii) Extending previous work we show how polynomial transformations can be achieved if one allows the resulting program to contain new atoms. The program obtained is still in a strong sense equivalent to the original theory, and the answer sets of the theory can be retrieved from it.

[1]  Matthew B. Blaschko,et al.  On Hausdorff Distance Measures , 2004 .

[2]  Stefan Woltran,et al.  A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report , 2002, NMR.

[3]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[4]  Mauricio Osorio,et al.  Safe beliefs for propositional theories , 2005, Ann. Pure Appl. Log..

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

[6]  Norman Y. Foo,et al.  Updating Logic Programs , 1998, ECAI.

[7]  David Pearce,et al.  A Tableau Calculus for Equilibrium Entailment , 2000, TABLEAUX.

[8]  Martin Homola,et al.  Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs , 2004, CLIMA.

[9]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

[10]  Reiner Hähnle,et al.  Tutorial: Complexity of many-valued logics , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

[11]  Narendra Ahuja,et al.  Detecting Faces in Images: A Survey , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Brett Browning,et al.  Multi-robot team response to a multi-robot opponent team , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[13]  Richard I. Kittredge,et al.  Using natural-language processing to produce weather forecasts , 1994, IEEE Expert.

[14]  Vladimir Lifschitz,et al.  Weight constraints as nested expressions , 2003, Theory and Practice of Logic Programming.

[15]  Yan Huang,et al.  ARGMode - Activity Recognition using Graphical Models , 2003, 2003 Conference on Computer Vision and Pattern Recognition Workshop.

[16]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[17]  José Júlio Alferes,et al.  Dynamic updates of non-monotonic knowledge bases , 2000, J. Log. Program..

[18]  Michael Zock,et al.  Architectures for Natural Language Generation: Problems and Perspectives , 1993, EWNLG.

[19]  Stefan Woltran,et al.  DISJUNCTIVE LOGIC PROGRAMS , 2002 .

[20]  Stefan Woltran,et al.  nlp: A Compiler for Nested Logic Programming , 2004, LPNMR.

[21]  José Júlio Alferes,et al.  The Refined Extension Principle for Semantics of Dynamic Logic Programming , 2005, Stud Logica.

[22]  Peter Gärdenfors,et al.  Belief Revision , 1995 .

[23]  José Júlio Alferes,et al.  Abduction in well-founded semantics and generalized stable models via tabled dual programs , 2003, Theory and Practice of Logic Programming.

[24]  Reiner Hähnle,et al.  Complexity of Many-Valued Logics. , 2001 .

[25]  Hans Tompits,et al.  On properties of update sequences based on causal rejection , 2001, Theory and Practice of Logic Programming.

[26]  Bernhard Schölkopf,et al.  Semiparametric Support Vector and Linear Programming Machines , 1998, NIPS.

[27]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[28]  Toby Walsh,et al.  mCP Nets: Representing and Reasoning with Preferences of Multiple Agents , 2004, AAAI.

[29]  Daniel P. Huttenlocher,et al.  A multi-resolution technique for comparing images using the Hausdorff distance , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[30]  Walter Daelemans,et al.  Introduction to the special issue on memory-based language processing , 1999, J. Exp. Theor. Artif. Intell..

[31]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

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

[33]  Ronald R. Yager,et al.  Fusion of multi-agent preference orderings , 2001, Fuzzy Sets Syst..

[34]  Nello Cristianini,et al.  Kernel Methods for Pattern Analysis , 2003, ICTAI.

[35]  Trevor Darrell,et al.  Integrated Person Tracking Using Stereo, Color, and Pattern Detection , 2000, International Journal of Computer Vision.

[36]  James C. Lester,et al.  Narrative prose generation , 2001, Artif. Intell..

[37]  Pedro Cabalar,et al.  Propositional theories are strongly equivalent to logic programs , 2007, Theory Pract. Log. Program..

[38]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[39]  Klaus J. Kirchberg,et al.  Genetic Model Optimization for Hausdorff Distance-Based Face Localization , 2002, Biometric Authentication.

[40]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[41]  Claire Cardie,et al.  A Case-Based Approach to Knowledge Acquisition for Domain-Specific Sentence Analysis , 1993, AAAI.

[42]  P. Robinson ROOT-N-CONSISTENT SEMIPARAMETRIC REGRESSION , 1988 .

[43]  W. González-Manteiga,et al.  Support vector machines and gradient boosting for graphical estimation of a slate deposit , 2004 .

[44]  Brett Browning,et al.  CAMEO: Camera Assisted Meeting Event Observer , 2007 .

[45]  Ján Sefránek,et al.  A Kripkean Semantics for Dynamic Logic Programming , 2000, LPAR.

[46]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[47]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[48]  Pierre-Yves Schobbens,et al.  Operators and Laws for Combining Preference Relations , 2002, J. Log. Comput..

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

[50]  Hong Yan,et al.  Fast algorithm for locating head boundaries , 1994, J. Electronic Imaging.

[51]  James R. Meehan,et al.  TALE-SPIN, An Interactive Program that Writes Stories , 1977, IJCAI.

[52]  Bernhard Fröba,et al.  Robust Face Detection at Video Frame Rate Based on Edge Orientation Features , 2002, FGR.

[53]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[54]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[55]  Manfred Stede,et al.  Lexical Options in Multilingual Generation from a Knowledge Base , 1993, EWNLG.

[56]  J. Suykens,et al.  A comparative study of ls-svm’s applied to the silver box identification problem , 2004 .

[57]  N. Aronszajn Theory of Reproducing Kernels. , 1950 .

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

[59]  José Júlio Alferes,et al.  From Logic Programs Updates to Action Description Updates , 2004, CLIMA.

[60]  José Júlio Alferes,et al.  MINERVA - A Dynamic Logic Programming Agent Architecture , 2001, ATAL.

[61]  Phan Minh Dung,et al.  Declarative Semantics of Hypothetical Logic Programming with Negation as Failure , 1992, ELP.

[62]  Ehud Reiter,et al.  Book Reviews: Building Natural Language Generation Systems , 2000, CL.

[63]  Raquel Hervás,et al.  Story plot generation based on CBR , 2004, Knowl. Based Syst..

[64]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[65]  Thomas S. Huang,et al.  Gesture modeling and recognition using finite state machines , 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580).

[66]  Walter Daelemans,et al.  The Acquisition of Stress: A Data-Oriented Approach , 1994, Comput. Linguistics.

[67]  David Pearce,et al.  From Here to There: Stable Negation in Logic Programming , 1999 .

[68]  P. Speckman Kernel smoothing in partial linear models , 1988 .

[69]  Luís Moniz Pereira,et al.  Iterated Logic Program Updates , 1998, IJCSLP.

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

[71]  Jan Chomicki,et al.  Preference formulas in relational queries , 2003, TODS.

[72]  K. Arrow Social Choice and Individual Values , 1951 .

[73]  Grigori Mints,et al.  Resolution Strategies for the Intuitionistic Logic , 1993, NATO ASI CP.

[74]  José Júlio Alferes,et al.  LUPSA language for updating logic programs , 1999, Artif. Intell..

[75]  José Júlio Alferes,et al.  Debugging by Diagnosing Assumptions , 1993, AADEBUG.

[76]  David Pearce,et al.  Computing Equilibrium Models Using Signed Formulas , 2000, Computational Logic.

[77]  Laura Giordano,et al.  Combining Negation as Failure and Embedded Implications in Logic Programs , 1998, J. Log. Program..

[78]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

[79]  Dietmar Seipel,et al.  Using clausal deductive databases for defining semantics in disjunctive deductive databases , 2001, Annals of Mathematics and Artificial Intelligence.

[80]  Raquel Hervás,et al.  Una arquitectura software para el desarrollo de aplicaciones de generación de lenguaje natural , 2004, Proces. del Leng. Natural.

[81]  Chiaki Sakama,et al.  Updating Extended Logic Programs through Abduction , 1999, LPNMR.

[82]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[83]  Klaus J. Kirchberg,et al.  Robust Face Detection Using the Hausdorff Distance , 2001, AVBPA.

[84]  Werasak Kurutach,et al.  A NOVEL APPROACH FOR ROBUST, FAST AND ACCURATE FACE DETECTION , 2001 .

[85]  Agnar Aamodt,et al.  Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches , 1994, AI Commun..

[86]  Larry S. Davis,et al.  Human expression recognition from motion using a radial basis function network architecture , 1996, IEEE Trans. Neural Networks.

[87]  Hwee Tou Ng,et al.  Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach , 1996, ACL.

[88]  Luís Moniz Pereira,et al.  Preferring and Updating in Logic-Based Agents , 2001, INAP.

[89]  José Júlio Alferes,et al.  Evolving Logic Programs , 2002, JELIA.

[90]  Stuart J. Russell,et al.  Dynamic bayesian networks: representation, inference and learning , 2002 .

[91]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[92]  Wolfgang Faber,et al.  Disjunctive Logic Programs with Inheritance , 1999, ICLP.

[93]  Mario Lenz,et al.  Case Retrieval Nets: Basic Ideas and Extensions , 1996, KI.

[94]  Svetha Venkatesh,et al.  Recognizing and monitoring high-level behaviors in complex spatial environments , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..