From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic

DOI10.1016/0304-3975(92)90051-GzbMath0761.68055OpenAlexW2155936349MaRDI QIDQ1194328

Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90051-g

zbMATH Keywords

Horn clause logiclogic programming language

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Artificial intelligence (68T99) Logic programming (68N17)

Related Items

Finite failures and partial computations in concurrent logic languages ⋮ Unnamed Item ⋮ Semantic models for concurrent logic languages ⋮ Four domains for concurrency ⋮ A framework for computing finite SLD trees ⋮ A timed concurrent constraint language. ⋮ Rendez-vous with metric semantics

Cites Work

• Declarative modeling of the operational behavior of logic languages
• Comparative semantics for prolog with cut
• Semantic models for concurrent logic languages
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• Processes and the denotational semantics of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item