393 search results - page 1 / 79 » Logic Programs with Classical Negation |
ICLP
1990
Springer
13 years 11 months ago
1990
Springer
ACL
1990
13 years 8 months ago
1990
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
ISMVL
2003
IEEE
14 years 19 days ago
2003
IEEE
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
SLP
1994
13 years 8 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...