Logic Programming with General Clauses and Defaults Based on Model Elimination
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 395-399.
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.
@inproceedings{ijcai1989p63,
title = {Logic Programming with General Clauses and Defaults Based on Model Elimination},
author = {Casanova, Marco A. and Guerreiro, Ramiro A. de T. and Silva, Andrea},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {395--399},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/63},
}
TY - CPAPER TI - Logic Programming with General Clauses and Defaults Based on Model Elimination AU - Casanova, Marco A. AU - Guerreiro, Ramiro A. de T. AU - Silva, Andrea T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 395 EP - 399 UR - https://ijcai.org/proceedings/1989/63 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
