167 search results - page 18 / 34 » Possibilistic-Based Argumentation: An Answer Set Programming... |
ARGMAS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this work, an agent architecture that combines defeasible argumentation and the BDI model is described. Argumentation will be used as a mechanism for reasoning about b...
LPNMR
2001
Springer
14 years 12 days ago
2001
Springer
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...