AGP
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
AIIA
1991
Springer
13 years 11 months ago
1991
Springer
Multimodal interfaces combining, e.g., natural language and graphics take advantage of both the individual strength of each communication mode and the fact that several modes can ...
AIIA
1991
Springer
13 years 11 months ago
1991
Springer
AIIA
1991
Springer
13 years 11 months ago
1991
Springer
The following paper describes FSS-WASTL, a system for the acquisition of semantic knowledge within XTRA – a natural language access system to expert systems. Starting from user-...
AIIA
1991
Springer
13 years 11 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
TABLEAUX
1995
Springer
13 years 11 months ago
1995
Springer
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
TABLEAUX
1995
Springer
13 years 11 months ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
TABLEAUX
1995
Springer
13 years 11 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
SBIA
1995
Springer
13 years 11 months ago
1995
Springer
ion Framework for Compositional Modeling 36 Diane Chi and Yumi Iwasaki Model Decomposition and Simulation 45 Daniel J. Clancy and Benjamin Kuipers A Distance Measure for Attention ...
WIA
1997
Springer
13 years 11 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...