198
Voted
NIL
15 years 4 months ago
1991 
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
151
Voted
LICS
15 years 4 months ago
1991 IEEE 
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
142
Voted
KR
15 years 4 months ago
1991 Springer 
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
123
Voted
LICS
15 years 4 months ago
1991 IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
122
click to vote
LICS
15 years 4 months ago
1991 IEEE 
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
|
Automated Reasoning