Issues in parallel execution of non-monotonic reasoning systems

We explore the major issues involved in the automatic exploitation of parallelism from the execution models of logic-based non-monotonic reasoning systems. We describe orthogonal techniques to parallelize the computation of models of non-monotonic logic theories, and demonstrate the effectiveness of the proposed techniques in prototypical implementation.

[1]  Chitta Baral.  Knowledge Representation, Reasoning and Declarative Problem Solving: Query answering and answer set computing systems , 2003 .

[2]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

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

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

[5]  Jack Minker,et al.  An Overview of Nonmonotonic Reasoning and Logic Programming , 1993, J. Log. Program..

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

[7]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[8]  Victor W. Marek,et al.  Computing stable models in parallel , 2001, Answer Set Programming.

[9]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[10]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[11]  Miroslaw Truszczynski,et al.  DATALOG with Constraints - An Answer-Set Programming System , 2000, AAAI/IAAI.

[12]  Martín Abadi,et al.  Security analysis of cryptographically controlled access to XML documents , 2005, PODS '05.

[13]  Wolfgang Faber,et al.  Answer Set Planning under Action Costs , 2002, JELIA.

[14]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[15]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

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

[17]  Enrico Pontelli,et al.  Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems , 1997, IPPS.

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

[19]  Esra Erdem,et al.  Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming , 2003, PADL.

[20]  Khayri A. M. Ali,et al.  The Muse Or-Parallel Prolog Model and its Performance , 1990, NACLP.

[21]  Ilkka Niemelä,et al.  Stable Model Semantics of Weight Constraint Rules , 1999, LPNMR.

[22]  Mats Carlsson,et al.  Parallel execution of prolog programs: a survey , 2001, TOPL.

[23]  Michael Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory Pract. Log. Program..

[24]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

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

[26]  Gopal Gupta.  Multiprocessor Execution of Logic Programs , 1994, Springer US.

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

[28]  Desh Ranjan,et al.  On the Complexity of Dependent And-Parallelism in Logic Programming , 2003, ICLP.

[29]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[30]  Ehud Shapiro,et al.  Third International Conference on Logic Programming , 1986 .

[31]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[32]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

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

[34]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[35]  Enrico Pontelli,et al.  Efficient Backtracking in And-Parallel Implementations of Non-deterministic Languages , 1998, ICPP.

[36]  Yves Deville,et al.  A Distributed Arc-Consistency Algorithm , 1995, Sci. Comput. Program..

[37]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[38]  Michael Gelfond.  The USA-Advisor: A Case Study in Answer Set Programming , 2002, JELIA.

[39]  Georg Gottlob,et al.  Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..

[40]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

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

[42]  Shamim A. Naqvi,et al.  Non-Deterministic Choice in Datalog , 1988, JCDKB.

[43]  Enrico Pontelli,et al.  Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP , 2004, ICLP.

[44]  Tran Cao Son,et al.  Semantic Web Services , 2001, IEEE Intell. Syst..

[45]  Christian Schulte.  Comparing Trailing and Copying for Constraint Programming , 1999, ICLP.

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

[47]  Tran Cao Son,et al.  Mobilizing the Semantic Web with DAML-enabled Web Services , 2001, SemWeb.

[48]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[49]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

[50]  Christian Schulte,et al.  Programming Constraint Inference Engines , 1997, CP.

[51]  Victor W. Marek,et al.  Default Reasoning System DeReS , 1996, KR.

[52]  Ilkka Niemelä,et al.  Answer Set Programming and Bounded Model Checking , 2001, Answer Set Programming.

[53]  Anil Nerode,et al.  Implementing Stable Semantics by Linear Programming , 1993, LPNMR.

[54]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[55]  Victor W. Marek,et al.  The Stable Models of a Predicate Logic Program , 1994, J. Log. Program..

[56]  V. S. Subrahmanian,et al.  WFS + Branch and Bound = Stable Models , 1995, IEEE Trans. Knowl. Data Eng..

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

[58]  Miroslaw Truszczynski,et al.  dcs: An Implementation of DATALOG with Constraints , 2000, ArXiv.

[59]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[60]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[61]  I. V. Ramakrishnan,et al.  Efficient Tabling Mechanisms for Logic Programs , 1995, ICLP.

[62]  V. S. Subrahmanian,et al.  Hybrid Probabilistic Programs , 2000, J. Log. Program..

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

[64]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

[65]  Ann Q. Gates,et al.  TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 2005 .

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

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

[68]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[69]  Michael Gelfond,et al.  Logic Programs with Consistency-Restoring Rules , 2003 .

[70]  Enrico Pontelli,et al.  Smodels with CLP?A Treatment of Aggregates in ASP , 2004, LPNMR.

[71]  G. Antoniou.  Stable Model Semantics of Logic Programs , 1997 .

[72]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[73]  Victor W. Marek,et al.  The Logic Programming Paradigm , 1999, Artificial Intelligence.

[74]  David Scott Warren,et al.  Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..