105 search results - page 19 / 21 » Optimal Proof Systems for Propositional Logic and Complete S... |
135
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
113
click to vote
CAV
2008
Springer
15 years 3 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
203
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
134
click to vote
AI
2007
Springer
15 years 1 months ago
2007
Springer
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...