Tkk Dissertations in Information and Computer Science Modularity in Answer Set Programs the Faculty of Information and Natural Sciences, for Public Examination and Debate in Auditorium T2

Answer set programming (ASP) is an approach to rule-based constraint programming allowing flexible knowledge representation in variety of application areas. The declarative nature of ASP is reflected in problem solving. First, a programmer writes down a logic program the answer sets of which correspond to the solutions of the problem. The answer sets of the program are then computed using a special purpose search engine, an ASP solver. The development of efficient ASP solvers has enabled the use of answer set programming in various application domains such as planning, product configuration, computer aided verification, and bioinformatics. The topic of this thesis is modularity in answer set programming. While modern programming languages typically provide means to exploit modularity in a number of ways to govern the complexity of programs and their development process, relatively little attention has been paid to modularity in ASP. When designing a module architecture for ASP, it is essential to establish full compositionality of the semantics with respect to the module system. A balance is sought between introducing restrictions that guarantee the compositionality of the semantics and enforce a good programming style in ASP, and avoiding restrictions on the module hierarchy for the sake of flexibility of knowledge representation. To justify a replacement of a module with another, that is, to be able to guarantee that changes made on the level of modules do not alter the semantics of the program when seen as an entity, a notion of equivalence for modules is provided. In close connection with the development of the compositional module architecture, a transformation from verification of equivalence to search for answer sets is developed. The translation-based approach makes it unnecessary to develop a dedicated tool for the equivalence verification task by allowing the direct use of existing ASP solvers. Translations and transformations between different problems, program classes, and formalisms are another central theme in the thesis. To guarantee efficiency and soundness of the translation-based approach, certain syntactical and semantical properties of transformations are desirable, in terms of translation time, solution correspondence between the original and the transformed problem, and locality/globality of a particular transformation. In certain cases a more refined notion of minimality than that inherent in ASP can make program encodings more intuitive. Lifschitz’ parallel and prioritized circumscription offer a solution in which certain atoms are allowed to vary or to have fixed values while others are falsified as far as possible according to priority classes. In this thesis a linear and faithful transformation embedding parallel and prioritized circumscription into ASP is provided. This enhances the knowledge representation capabilities of answer set programming by allowing the use of existing ASP solvers for computing parallel and prioritized circumscription.

[1]  Chitta Baral,et al.  Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming , 2006, ICLP.

[2]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

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

[4]  Stefan Woltran,et al.  A common view on strong, uniform, and other notions of equivalence in answer-set programming* , 2007, Theory and Practice of Logic Programming.

[5]  Pasi Lehtimäki,et al.  Data analysis methods for cellular network performance optimization , 2008 .

[6]  Thomas Eiter,et al.  Towards Automated Integration of Guess and Check Programs in Answer Set Programming , 2004, LPNMR.

[7]  Fangzhen Lin.  Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic , 2002, KR.

[8]  Giovambattista Ianni,et al.  Enhancing answer set programming with templates , 2004, NMR.

[9]  Stefan Woltran,et al.  Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection , 2007, AAAI.

[10]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[11]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[12]  A. Mostowski.  On a generalization of quantifiers , 1957 .

[13]  Chiaki Sakama,et al.  Equivalence of Logic Programs Under Updates , 2004, JELIA.

[14]  Thomas Eiter,et al.  Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications , 2004, Theory and Practice of Logic Programming.

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

[16]  Stefan Woltran,et al.  Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming , 2005, Answer Set Programming.

[17]  Hudson Turner,et al.  Strong equivalence made easy: nested expressions and weight constraints , 2003, Theory and Practice of Logic Programming.

[18]  Roberto Giacobazzi,et al.  Compositional analysis of modular logic programs , 1993, POPL '93.

[19]  Robert A. Kowalski,et al.  Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes) , 1988, ICLP/SPL.

[20]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[21]  Miroslaw Truszczynski,et al.  Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers , 2005, LPNMR.

[22]  Wolfgang Faber,et al.  Testing Strong Equivalence of Datalog Programs - Implementation and Examples , 2005, LPNMR.

[23]  Reijo Sulonen,et al.  Representing Configuration Knowledge With Weight Constraint Rules , 2001, Answer Set Programming.

[24]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

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

[26]  Chitta Baral,et al.  A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling , 2005, Answer Set Programming.

[27]  Nikolaj Tatti,et al.  Advances in Mining Binary Data: Itemsets as Summaries , 2008 .

[28]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[29]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[30]  Tomi Janhunen,et al.  Testing the Equivalence of Logic Programs under Stable Model Semantics , 2002, JELIA.

[31]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[32]  Michael Gelfond,et al.  Representing Knowledge in A-Prolog , 2002, Computational Logic: Logic Programming and Beyond.

[33]  Antonio Brogi,et al.  Modular logic programming , 1994, TOPL.

[34]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[35]  Stefan Woltran,et al.  Encodings for Equilibrium Logic and Logic Programs with Nested Expressions , 2001, EPIA.

[36]  Victor W. Marek,et al.  Logic programs with monotone abstract constraint atoms* , 2006, Theory and Practice of Logic Programming.

[37]  Tomi Janhunen,et al.  Verifying the Equivalence of Logic Programs in the Disjunctive Case , 2004, LPNMR.

[38]  Yuanlin Zhang,et al.  Fast SAT-based Answer Set Solver , 2006, AAAI.

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

[40]  Kurt Konolige,et al.  Eliminating the Fixed Predicates from a Circumscription , 1989, Artif. Intell..

[41]  Laura Giordano,et al.  Structuring Logic Programs: A Modal Approach , 1994, J. Log. Program..

[42]  Francesco Buccafurri,et al.  Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.

[43]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[44]  Sandro Etalle,et al.  Transformations of CLP Modules , 1996, Theor. Comput. Sci..

[45]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

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

[47]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[48]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[49]  Antti Ukkonen,et al.  ALGORITHMS FOR FINDING ORDERS AND ANALYZING SETS OF CHAINS , 2008 .

[50]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[51]  Martin Gebser,et al.  The nomore++ System , 2005, LPNMR.

[52]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[53]  Tomi Janhunen,et al.  LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs , 2004, LPNMR.

[54]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[55]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[56]  Esra Erdem,et al.  Temporal phylogenetic networks and logic programming , 2005, Theory and Practice of Logic Programming.

[57]  Paolo Ferraris,et al.  On Modular Translations and Strong Equivalence , 2005, LPNMR.

[58]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

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

[60]  Fangzhen Lin,et al.  Loop formulas for circumscription , 2004, Artif. Intell..

[61]  Wolfgang Faber,et al.  Magic Sets and their application to data integration , 2005, J. Comput. Syst. Sci..

[62]  Fangzhen Lin,et al.  SELP - A System for Studying Strong Equivalence between Logic Programs , 2005, Answer Set Programming.

[63]  Gerhard Brewka,et al.  Logic programming with ordered disjunction , 2002, NMR.

[64]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[65]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[66]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[67]  Antonio Brogi,et al.  Programming by Combining General Logic Programs , 1999, J. Log. Comput..

[68]  Michael Gelfond,et al.  Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.

[69]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

[70]  Esra Erdem,et al.  Inferring Phylogenetic Trees Using Answer Set Programming , 2007, Journal of Automated Reasoning.

[71]  Georg Gottlob,et al.  Modular Logic Programming and Generalized Quantifiers , 1997, LPNMR.

[72]  Sandro Etalle,et al.  A Compositional Semantics for Normal Open Programs , 1996, JICSLP.

[73]  Enrico Pontelli,et al.  A Constructive semantic characterization of aggregates in answer set programming , 2007, Theory Pract. Log. Program..

[74]  Yuliya Lierler,et al.  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.

[75]  Vladimir Lifschitz,et al.  Answer Set Planning (Abstract) , 1999, LPNMR.

[76]  Fabio Massacci,et al.  Verifying security protocols as planning in logic programming , 2001, ACM Trans. Comput. Log..

[77]  Keijo Heljanko,et al.  Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.

[78]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[79]  TurnerHudson.  Strong equivalence made easy: nested expressions and weight constraints , 2003 .

[80]  Michael J. Maher.  A Transformation System for Deductive Database Modules with Perfect Model Semantics , 1989, FSTTCS.

[81]  Martin D. F. Wong,et al.  Wire Routing and Satisfiability Planning , 2000, Computational Logic.

[82]  Chiaki Sakama,et al.  Coordination in answer set programming , 2008, TOCL.

[83]  David Pearce,et al.  Minimal Logic Programs , 2007, ICLP.

[84]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[85]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..

[86]  Chiaki Sakama,et al.  Prioritized logic programming and its application to commonsense reasoning , 2000, Artif. Intell..

[87]  Joxan Jaffar.  Logic programming : proceedings of the 1998 Joint International Conference and Symposium on Logic Programming , 1998 .

[88]  Chiaki Sakama,et al.  Constructing Consensus Logic Programs , 2006, LOPSTR.

[89]  Hans Tompits,et al.  A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning , 2004, Comput. Intell..

[90]  Maurice Bruynooghe,et al.  Partial Stable Models for Logic Programs with Aggregates , 2004, LPNMR.

[91]  Wakaki Toshiko,et al.  Compiling Prioritized Circumscription into General Disjunctive Programs by Integration of Guess and Check Programs , 2006 .

[92]  Thomas Eiter,et al.  Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.

[93]  Peter Baumgartner,et al.  Semantically Guided Theorem Proving for Diagnosis Applications , 1997, IJCAI.

[94]  Tomi Janhunen,et al.  Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.

[95]  Michael Gelfond,et al.  Logic programming and knowledge representation—The A-Prolog perspective , 2002 .

[96]  Chitta Baral,et al.  A knowledge based approach for representing and reasoning about signaling networks , 2004, ISMB/ECCB.

[97]  François Bry.  A Compositional Semantics for Logic Programs and Deductive Databases , 1996, JICSLP.

[98]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[99]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[100]  Dale Miller,et al.  A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..

[101]  Patrik Simons,et al.  Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.

[102]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

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

[104]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[105]  Chiaki Sakama,et al.  Embedding Circumscriptive Theories in General Disjunctive Programs , 1995, LPNMR.

[106]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[107]  Chiaki Sakama,et al.  Combining Answer Sets of Nonmonotonic Logic Programs , 2005, CLIMA.

[108]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[109]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[110]  Danny De Schreye,et al.  Compositionality of Normal Open Logic Programs , 1997, J. Log. Program..

[111]  Perlindström.  First Order Predicate Logic with Generalized Quantifiers , 1966 .

[112]  Tomi Janhunen.  On the Effect of Default Negation on the Expressiveness of Disjunctive Rules , 2001, LPNMR.

[113]  Haim Gaifman,et al.  Fully abstract compositional semantics for logic programs , 1989, POPL '89.

[114]  Alfredo Gabaldon,et al.  Building a knowledge base: an example , 1999, Annals of Mathematics and Artificial Intelligence.

[115]  Sarit Kraus,et al.  Combining Multiple Knowledge Bases , 1991, IEEE Trans. Knowl. Data Eng..

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

[117]  Katsumi Inoue,et al.  Compiling Prioritized Circumscription into Answer Set Programming , 2004, ICLP.

[118]  Markus Harva,et al.  ALGORITHMS FOR APPROXIMATE BAYESIAN INFERENCE WITH APPLICATIONS TO ASTRONOMICAL DATA ANALYSIS , 2008 .

[119]  Ilkka Niemelä,et al.  DES: a Challenge Problem for Nonmonotonic Reasoning Systems , 2000, ArXiv.

[120]  Robert F. Stärk,et al.  Input/Output Dependencies of Normal Logic Programs , 1994, J. Log. Comput..

[121]  Stefan Woltran,et al.  Characterizations for Relativized Notions of Equivalence in Answer Set Programming , 2004, JELIA.

[122]  Georg Gottlob,et al.  An Efficient Method for Eliminating Varying Predicates from a Circumscription , 1992, Artif. Intell..

[123]  Stefan Woltran,et al.  Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.

[124]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

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

[126]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[127]  José Júlio Alferes,et al.  Logics in Artificial Intelligence 9th European Conference, Jelia 2004, Lisbon, Portugal, September 27-30, 2004 : Proceedings , 2004 .

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

[129]  Richard A. O'Keefe,et al.  Towards an Algebra for Constructing Logic Programs , 1985, International Conference on Spoken Language Processing.

[130]  Paolo Mancarella,et al.  An Algebra of Logic Programs , 1988, ICLP/SLP.

[131]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[132]  Tomi Janhunen,et al.  Modular Equivalence for Normal Logic Programs , 2006, ECAI.

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