119 search results - page 2 / 24 » Tree-Width for First Order Formulae |
114
Voted
PUK
2000
15 years 1 months ago
2000
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
114
Voted
IJCAI
2001
15 years 1 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
107
click to vote
CADE
2003
Springer
16 years 14 days ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
TBILLC
2007
Springer
15 years 6 months ago
2007
Springer
71
Voted
JSYML
2000
14 years 12 months ago
2000