Title :
Computing answers in default logic
Author :
Guerreiro, R.A.T. ; Silva, Andrea ; Casanova, Marco A.
Author_Institution :
IBM Brazil, Rio de Janeiro, Brazil
Abstract :
A class of logic programming systems based on R. Reiter´s (1980) default logic is discussed. The first question addressed is how to compute answers when a query is a set of clauses and a program is a set of clauses and defaults. The clauses are not restricted to be Horn clauses and the defaults are a special case of Reiter´s open normal defaults. Then, the problem of computing answers is discussed in the context of the concept of typical elements. This concept of typicality is carefully defined and given a clean semantics
Keywords :
logic programming; answer computation; computing answers; default logic; logic programming systems; semantics; typical elements; typicality; Birds; Fuzzy reasoning; Joining processes; Logic programming; Probability; Prototypes;
Conference_Titel :
Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-1984-8
DOI :
10.1109/TAI.1989.65371
