Sciweavers

101 search results - page 4 / 21
» Some Progress in Satisfiability Checking for Difference Logi...
Sort
View
DLOG
1998
13 years 8 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
DLOG
2009
13 years 5 months ago
Quasi-Classical Semantics for Expressive Description Logics
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
Xiaowang Zhang, Guilin Qi, Yue Ma, Zuoquan Lin
DAC
2004
ACM
14 years 8 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
AGP
1998
IEEE
13 years 11 months ago
Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...
Agostino Dovier, Carla Piazza, Gianfranco Rossi