3776 search results - page 478 / 756 » Partition-Based Logical Reasoning |
135
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
120
click to vote
CADE
2006
Springer
15 years 6 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
106
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Norms are essential to extend inference: inferences based on norms are far richer than those based on logical implications. In the recent decades, much effort has been devoted to r...
101
click to vote
CADE
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
130
click to vote
JURIX
2007
15 years 3 months ago
2007
Today’s argumentation software mostly emphasizes the logical structure of reasoning, and especially the structure as it can be represented in boxes-andarrows style diagrams. In t...