Many Hands Make Light Work: Localized Satisfiability for Multi-Context Systems

In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, we propose a distributed decision procedure that maximally exploits the potential amenity of localizing reasoning and restricting it to relevant contexts. We show that the latter approach is computationally superior to our translation-based procedure, and outline how off-the-shelf efficient reasoning procedures can be used to implement our algorithm.

[1]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[2]  John McCarthy,et al.  Generality in artificial intelligence , 1987, Resonance.

[3]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[4]  R. Guha.  Contexts: a formalization and some applications , 1992 .

[5]  Fausto Giunchiglia,et al.  Multilanguage hierarchical logics (or: how we can do without modal logics) , 1994, CNKBS.

[6]  John McCarthy,et al.  Notes on Formalizing Context , 1993, IJCAI.

[7]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[8]  J. McCarthy,et al.  Formalizing Context (Expanded Notes) , 1994 .

[9]  Fabio Massacci,et al.  Contextual Reasoning Is NP-Complete , 1996, AAAI/IAAI, Vol. 1.

[10]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

[11]  Joao Marques-Silva,et al.  Robust search algorithms for test pattern generation , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[12]  Laurent Perrussel,et al.  Contextual Reasoning , 1998, ECAI.

[13]  Fausto Giunchiglia,et al.  Local Models Semantics, or Contextual Reasoning = Locality + Compatibility , 1998, KR.

[14]  E. Clarke,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[15]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[16]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..

[17]  Sheila A. McIlraith,et al.  Partition-Based Logical Reasoning , 2000, KR.

[18]  M. Moskewicz,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[19]  Ulrike Sattler,et al.  BDD-Based Decision Procedures for K , 2002, CADE.

[20]  Marco Pistore,et al.  Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..

[21]  Hantao Zhang.  Generating College Conference Basketball Schedules by a SAT Solver , 2003 .

[22]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[23]  Pietro Torasso,et al.  Computing Minimum-Cardinality Diagnoses Using OBDDs , 2003, KI.

[24]  M. Bozzano,et al.  Integrating Fault Tree Analysis with Event Ordering Information ∗ , 2003 .

[25]  Luciano Serafini,et al.  Comparing formal theories of context in AI , 2004, Artif. Intell..

[26]  Floris Roelofsen,et al.  Complexity of Contextual Reasoning , 2004, AAAI.