2062 search results - page 154 / 413 » Derivatives of Logical Formulas |
144
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
142
click to vote
ICRA
2007
IEEE
15 years 10 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...
119
click to vote
PODS
2000
ACM
15 years 8 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
150
click to vote
DALT
2004
Springer
15 years 7 months ago
2004
Springer
Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that pr...
112
Voted
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...