261 search results - page 32 / 53 » Proof Normalization Modulo |
TAPSOFT
1997
Springer
15 years 6 months 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...
136
click to vote
PADL
2007
Springer
15 years 8 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...
127
click to vote
AMAI
2004
Springer
15 years 7 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
15 years 3 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...
117
click to vote
AAAI
1994
15 years 3 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...