4513 search results - page 113 / 903 » Logic programming with satisfiability |
131
click to vote
DBPL
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
117
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
143
click to vote
DLOG
2001
15 years 4 months ago
2001
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
118
click to vote
JAPLL
2008
15 years 3 months ago
2008
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
150
click to vote
ASP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...