Portal de Periódicos da CAPES

Complete logic programs with domain-closure axiom

1988; Elsevier BV; Volume: 5; Issue: 3 Linguagem: Inglês

10.1016/0743-1066(88)90013-1

1873-5789

Paolo Mancarella, Simone Martini, Dino Pedreschi,

Logic, programming, and type systems

Complete logic programs augmented with the domain-closure axiom are proposed as the reference theory for logic programming with negation as failure. An inference rule corresponding to “proof by case analysis” is proved correct within this framework. As a major consequence, the completeness results for SLD resolution and negation as failure still hold. An interesting outcome is that some novel operational properties of SLD resolution can be proved.