149 search results - page 16 / 30 » Argumentation Semantics for Defeasible Logics |
KR
2010
Springer
15 years 4 months ago
2010
Springer
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
103
click to vote
AIPS
1994
15 years 1 months ago
1994
We consider the problem of representing plans for mixed-initiative planning, where several participants cooperate to develop plans. We claim that in such an environment, a crucial...
KR
2000
Springer
15 years 3 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
COMMA
2008
15 years 1 months ago
2008
Abstract. We propose an abstract argumentation theory whose dynamics is captured by the application of belief revision concepts. The theory is deemed as abstract because both the u...
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...