261 search results - page 32 / 53 » Proof Normalization Modulo |
TAPSOFT
1997
Springer
14 years 18 days ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
PADL
2007
Springer
14 years 2 months ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
AIML
2004
13 years 10 months ago
2004
This paper aims to examine Horty's proposal of utilitarian deontic logic [7]. It will focus on his dominance operators by way of simplified semantics. An axiomatization of the...
AAAI
1994
13 years 9 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...