75 search results - page 2 / 15 » Reducing Query Answering to Satisfiability in Nonmonotonic L... |
IJAR
2008
13 years 5 months ago
2008
We introduce a general framework that is based on distance semantics and investigate the main properties of the entailment relations that it induces. It is shown that such entailm...
ESWS
2005
Springer
13 years 11 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
AAAI
2008
13 years 7 months ago
2008
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
ASP
2005
Springer
13 years 11 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
AAAI
2000
13 years 6 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...