70 search results - page 7 / 14 » Inferring acceptable arguments with Answer Set Programming |
SUM
2010
Springer
13 years 5 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
KI
2008
Springer
13 years 8 months ago
2008
Springer
ed from context by seeing an explanation inferentially, much in the same way that early expert systems saw an explanation as chaining of inferences. This approach omitted, for the ...
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...
ICSE
1997
IEEE-ACM
14 years 2 days ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...