4513 search results - page 95 / 903 » Logic programming with satisfiability |
106
click to vote
FUIN
2010
15 years 1 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
130
Voted
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
147
click to vote
LPNMR
1993
Springer
15 years 7 months ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
138
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
155
click to vote
TABLEAUX
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...