# Admissible rule

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- LPAR short papers
- 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

- Int. J. Intell. Syst.
- 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

- 1997

This paper describes and discusses the NICE project, an immersive learning environment for children implemented in the CAVE andâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- ACM Trans. Comput.-Hum. Interact.
- 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)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- ICGI
- 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

- J. ACM
- 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

- CHI
- 1992

The Graphic StoryWriter (GSW) is an interactive system that enables its users to create structurally complete stories through theâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- LICS
- 1991

We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variablesâ€¦Â (More)

Is this relevant?

1990

1990

- ICALP
- 1990

We propose a set of transformation rules for first order formulas whose atoms are either equations between terms or %oftâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Information and Control
- 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?