Admissible rule

Known as: Admissible inference rule, Inadmissible inference rule, Projective approximation 
In logic, a rule of inference is admissible in a formal system if the set of theorems of the system does not change when that rule is added to the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation… (More)
Is this relevant?
2002
2002
We propose an extension of the resolution rule as the core of a logic programming language based on similarity. Starting from a… (More)
Is this relevant?
1997
1997
This paper describes and discusses the NICE project, an immersive learning environment for children implemented in the CAVE and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We have developed a new model for coupling the user interfaces of a multiuser program. It is based on an interaction model and a… (More)
  • figure 2
  • figure 4
  • figure 12
Is this relevant?
Highly Cited
1994
Highly Cited
1994
(1) France T el ecom-CNET/LAA/TSS/RCP 2, route de Tr egastel 22301 Lannion Cedex (France) Abstract This paper revisits the theory… (More)
Is this relevant?
1992
1992
In this paper, it is shown that the method of matings due toAndrews and Bibel can be extended to (first-order) languages… (More)
Is this relevant?
1992
1992
The Graphic StoryWriter (GSW) is an interactive system that enables its users to create structurally complete stories through the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
1990
1990
We propose a set of transformation rules for first order formulas whose atoms are either equations between terms or %oft… (More)
  • figure I
  • figure 2
Is this relevant?
Highly Cited
1973
Highly Cited
1973
The unification problem in a logic ~ is the following: given two well formed formulas e 1 and e 2 of ~-q~, decide whether there… (More)
Is this relevant?