Stable Model Checking Made Easy
نویسندگان
چکیده
Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and reasoning. Reasoning with DLP is harder than with normal (∨-free) logic programs; because stable model checking – deciding whether a given model is a stable model of a propositional DLP program – is co-NP-complete, while it is polynomial for normal logic programs. This paper proposes a new transformation ΓM (P), which reduces stable model checking to UNSAT – i.e., to deciding whether a given CNF formula is unsatisfiable. Thus, the stability of a model M for a program P can be verified by calling a Satisfiability Checker on the CNF formula ΓM (P). The transformation is parsimonious and efficiently computable, as it runs in logarithmic space. Moreover, the size of the generated CNF formula never exceeds the size of the input. The proposed approach to stable model checking has been implemented in a DLP system, and a number of experiments and benchmarks have been run.
منابع مشابه
Temporal Logic Made Practical
In the late seventies, Pnueli suggested that functional properties of reactive systems be formally expressed in temporal logic. In order that model checking such a logic be possible, it must have sufficient expressive power, its semantics must be formally defined in a rigorous way, and the complexity of model checking it must be well understood and reasonable. In order to allow widespread adopt...
متن کاملPractically Making Threads Deterministic and Stable
Multithreaded programs are hard to get right. A key reason is that the contract between developers and runtimes grants exponentially many schedules to the runtimes. Two approaches improve correctness by reducing schedules. Deterministic multithreading (DMT) reduces schedules for each input down to one. Stable multithreading (SMT) reduces schedules for all inputs, increasing coverage of checking...
متن کاملFriends or Foes? An AI Planning Perspective on Abstraction and Search PRELIMINARY VERSION - UNDER REVIEW
There is increasing awareness that planning and model checking are closely related fields. Abstraction, as used in model checking, means to perform search in an overapproximation of the original problem instance, with a potentially much smaller state space; certain properties proved in the abstract problem are guaranteed to also hold for the original problem. This method is extremely successful...
متن کاملCoastal Water Level Prediction Model Using Adaptive Neuro-fuzzy Inference System
This paper employs Adaptive Neuro-Fuzzy Inference System (ANFIS) to predict water level that leads to flood in coastal areas. ANFIS combines the verbal power of fuzzy logic and numerical power of neural network for its action. Meteorological and astronomical data of Santa Monica, a coastal area in California, U. S. A., were obtained. A portion of the data was used to train the ANFIS network, wh...
متن کاملFriends or Foes? An AI Planning Perspective on Abstraction and Search
There is increasing awareness that planning and model checking are closely related fields. Abstraction means to perform search in an over-approximation of the original problem instance, with a potentially much smaller state space. This is the most essential method in model checking. One would expect that it can also be made successful in planning. We show, however, that this is likely to not be...
متن کامل