From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
DOI10.1016/0304-3975(92)90051-GzbMATH Open0761.68055OpenAlexW2155936349MaRDI QIDQ1194328FDOQ1194328
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
Artificial intelligence (68T99) Logic programming (68N17) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)
Cites Work
- The Semantics of Predicate Logic as a Programming Language
- Processes and the denotational semantics of concurrency
- Contributions to the Theory of Logic Programming
- Comparative semantics for prolog with cut
- Declarative modeling of the operational behavior of logic languages
- Semantic models for concurrent logic languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Four domains for concurrency
- Semantic models for concurrent logic languages
- A framework for computing finite SLD trees
- A timed concurrent constraint language.
- Title not available (Why is that?)
- Rendez-vous with metric semantics
- Finite failures and partial computations in concurrent logic languages
This page was built for publication: From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194328)
