Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.206, Iss.1, 1998-10, pp. : 257-281

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A non-ground realization of the stable and well-founded semantics

By Gottlob G. Marcus S. Nerode A. Salzer G. Subrahmanian V.S.

Theoretical Computer Science, Vol. 166, Iss. 1, 1996-10 ,pp. : 221-262

Elsevier

Access to resources Recommend Favorite

ACLP: Abductive Constraint Logic Programming

By Kakas A.C. Michael A. Mourlas C.

The Journal of Logic Programming, Vol. 44, Iss. 1, 2000-07 ,pp. : 129-177

Elsevier

Access to resources Recommend Favorite

An assumption-based truth maintenance system dealing with non-ground justifications

By Lamma Evelina Mello Paola

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 8, Iss. 1, 1996-01 ,pp. : 21-42

Taylor & Francis Ltd

Access to resources Recommend Favorite

Constraint Solving for Proof Planning

By Zimmer Jürgen Melis Erica

Journal of Automated Reasoning, Vol. 33, Iss. 1, 2004-07 ,pp. : 51-88

Springer Publishing Company

Access to resources Recommend Favorite

A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions

By Coquand C.

LISP and Symbolic Computation, Vol. 15, Iss. 1, 2002-03 ,pp. : 57-90

Springer Publishing Company

Access to resources Recommend Favorite