2303 search results - page 230 / 461 » On the logic of argumentation theory |
174
click to vote
IJAR
2007
15 years 6 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
230
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
153
click to vote
FUIN
2010
15 years 5 months ago
2010
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
196
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
164
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...