A model-theoretic reconstruction of the operational semantics of logic programs
From MaRDI portal
Publication:1803658
DOI10.1006/inco.1993.1015zbMath0788.68088OpenAlexW2054839338MaRDI QIDQ1803658
Moreno Falaschi, Maurizio Martelli, Catuscia Palamidessi, Giorgio Levi
Publication date: 29 June 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1015
Related Items
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424., An integrated framework for the diagnosis and correction of rule-based programs, A new generic scheme for functional logic programming with constraints, A new framework for declarative programming, Unfolding and fixpoint semantics of concurrent constraint logic programs, Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements, S-semantics for logic programming: a retrospective look, Abstract interpretation of resolution-based semantics, Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424., A Declarative Debugging System for Lazy Functional Logic Programs, Type dependencies for logic programs using ACI-unification, An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.