93 search results - page 19 / 19 » On the Computational Representation of Classical Logical Con... |
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
ENTCS
2008
13 years 4 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequenc...