2540 search results - page 46 / 508 » Abstract Logics as Dialgebras |
WOLLIC
2009
Springer
14 years 4 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
LPNMR
2001
Springer
14 years 2 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
ESOP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
AIML
2006
13 years 11 months ago
2006
abstract. We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R. This gives a negative solution to one of the questions rai...