Download:
by Sebastian Br, Rosella Gennari, Maarten De Rijke
http://www.science.uva.nl/~mdr/Publications/Files/ercim03-LNAI.pdf
Add To MetaCart
Abstract:
Abstract. Modal and modal-like formalisms such as temporal or description logics go beyond propositional logic by introducing operators that allow for a guarded form of quantification over states or paths of transition systems. Thus, they are more expressive than propositional logic, yet computationally better behaved than first-order logic. We propose constraint-based methods to model and solve modal satisfiability problems. We model the satisfiability of basic modal formulas via appropriate sets of finite constraint satisfaction problems, and then resolve these via constraint solvers. The domains of the constraint satisfaction problems contain other values than just the Boolean 0 or 1; for these values, we create specialised constraints that help us steer the decision procedure and so keep the modal search tree as small as possible. We show experimentally that this constraint modelling gives us a better control over the decision procedure than existing SAT-based models. 1
Citations
|
259
|
Modal Logic
– Blackburn, Rijke, et al.
- 2001
|
|
201
|
Using Temporal Logics to Express Search Control Knowledge for Planning
– Bacchus, Kabanza
- 2000
|
|
196
|
The Description Logic Handbook
– Baader, Calvanese, et al.
- 2003
|
|
124
|
An Empirical Analysis of Optimization Techniques for Terminological Representation Systems or: Making KRIS get a move on
– Baader, Franconi, et al.
- 1994
|
|
120
|
Logic in computer science: Modelling and reasoning about systems
– Huth, Ryan
- 2000
|
|
113
|
Building decision procedures for modal logics from propositional decision procedures - the case study of modal K
– Giunchiglia, Sebastiani
- 1996
|
|
107
|
Decision procedures for BDI logics
– Rao, Georgeff
- 1998
|
|
70
|
ECLiPSe: A platform for constraint logic programming
– Wallace, Novello, et al.
- 1997
|
|
57
|
On evaluating decision procedures for modal logic
– Hustadt, Schmidt
- 1997
|
|
52
|
Planning as Model Checking for Extended Goals in Non-deterministic Domains
– Pistore, Traverso
- 2001
|
|
45
|
A Benchmark Method for the Propositional Modal Logics K, KT, S4
– Heuerding, Schwendimann
- 1996
|
|
38
|
modal logics for mobile ambients
– Anytime
- 2000
|
|
34
|
XPath with conditional axis relations
– Marx
- 2004
|
|
25
|
An Analysis of Empirical Testing for Modal Decision Procedures
– Horrocks, Patel-Schneider, et al.
- 2000
|
|
22
|
Many-valued modal logics II
– Fitting
- 1992
|
|
21
|
Rijke. Tree-based Heuristics in Modal Theorem Proving
– Areces, Gennari, et al.
- 2000
|
|
20
|
BDD-Based Decision Procedures for K
– Pan, Sattler, et al.
- 2002
|
|
18
|
SAT System Description
– Tacchella
- 1999
|
|
9
|
On the unusual effectiveness of logic in computer science. The Bulletin of Symbolic Logic
– Halpern, Harper, et al.
- 2001
|
|
5
|
Schedulers for rule-based constraint programming
– Apt, Brand
- 2003
|
|
5
|
Accessed via http://www.cs.man.ac.uk/ ~horrocks/FaCT
– FaCT
- 2002
|
|
4
|
Accessed via http:// kogs-www.informatik.uni-hamburg.de/~race
– RACER
- 2002
|
|
2
|
On modal logic interpretations of games
– Meyer, Witteveen
- 2002
|
|
1
|
Accessed via http://www.cs.man.ac.uk/~schmidt/ mspass
– a
- 2001
|
|
1
|
Accessed via http://www.bell-labs.com.user/pfps/ dlp
– DLP
- 2002
|
