4513 search results - page 19 / 903 » Logic programming with satisfiability |
161
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized s...
199
click to vote
DLOG
2006
15 years 8 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
206
Voted
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
194
Voted
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
150
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...