2214 search results - page 126 / 443 » Complexity of Reasoning |
160
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
105
Voted
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
118
click to vote
LOGCOM
2006
15 years 3 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
164
click to vote
KR
2010
Springer
15 years 7 months ago
2010
Springer
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
144
Voted
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...