scispace - formally typeset
Search or ask a question

Showing papers by "Paolo Traverso published in 1996"


Journal ArticleDOI
TL;DR: The definition of MT is part of a larger project which aims at the implementation of self-reflective systems, i.e. systems which are able to introspect their own code, to reason about it and, possibly, to extend or modify it.

19 citations


Journal ArticleDOI
01 Aug 1996
TL;DR: NALIG is described, a system able to "understand" and "reason about" high level descriptions of spatial scenes in CAD systems for interior design by using a natural language interface which is expressive enough to allow the description of complex configurations of objects.
Abstract: We are mainly interested in the development of CAD systems for interior design. An effective use of such systems relies to a large extent on the characteristics of their user interface. This paper describes NALIG, a system able to "understand" and "reason about" high level descriptions of spatial scenes. The user interacts with the system by using a natural language interface which, though very simple, is expressive enough to allow the description of complex configurations of objects. NALIG replies by drawing on the screen an image mirroring its own "understanding" of the scene described. The comprehension process has required the integration of different AI-techniques (e.g., natural language understanding, spatial reasoning, default and common sense reasoning).

7 citations


Journal ArticleDOI
TL;DR: A first order classical metatheory, called MT, with the following properties, which can be used to reason about, extend and, possibly, modify the code implementing Program Tactics and the GETFOL basic inference rules.
Abstract: In this paper we present a first order classical metatheory, called MT, with the following properties: (1) tactics are terms of the language of MT (we call these tactics,Logic Tactics); (2) there exists a mapping between Logic Tactics and the tactics developed as programs within the GETFOL theorem prover (we call these tactics,Program Tactics). MT is expressive enough to represent the most interesting tacticals, i.e.,then, orelse, try, progress andrepeat. repeat allows us to express Logic Tactics which correspond to Program Tactics which may not terminate. This work is part of a larger project which aims at the development and mechanization of a metatheory which can be used to reason about, extend and, possibly, modify the code implementing Program Tactics and the GETFOL basic inference rules.

6 citations