Logic programming with general clauses and defaults based on model elimination

Authors:
Marco A. Casanova;Ramiro Guerreiro;Andrea Silva
Affiliations:
Rio Scientific Center, IBM Brazil, Rio de Janeiro, RJ, Brazil;Rio Scientific Center, IBM Brazil, Rio de Janeiro, RJ, Brazil;Rio Scientific Center, IBM Brazil, Rio de Janeiro, RJ, Brazil
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 2
Cited 1

Foundations of logic programming

Foundations of logic programming
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

STORK and PENGUIN: logic programming systems using general clauses and defaults

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation method is an extended version of weak model elimination. The first question addressed is how to compute answers with weak model elimination when queries and programs are sets of arbitrary clauses, which is completely settled by a soundness and completeness result. The question of computing only definite answers is also settled. Then, the problem of computing answers is rediscussed when the logic programs also include a finite set of defaults.