98 search results - page 11 / 20 » Combinations of Theories for Decidable Fragments of First-Or... |
DLOG
2006
13 years 8 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
IANDC
2007
13 years 7 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
JAR
2006
13 years 7 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...