2303 search results - page 265 / 461 » On the logic of argumentation theory |
277
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
206
click to vote
LICS
2007
IEEE
16 years 26 days ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
200
click to vote
TYPES
1998
Springer
15 years 10 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
143
click to vote
AAAI
1993
15 years 8 months ago
1993
Formal AI systems traditionally represent knowledge using logical formulas. We will show, however, that for certain kinds of information, a modelbased representation is more compa...
165
click to vote
PPDP
2007
Springer
16 years 21 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...