Observable behaviors and equivalences of logic programs

DOI10.1006/INCO.1995.1138MaRDI QIDQ1900312zbMATH OpenOpenAlexFDO

Authors Giorgio Levi, Maurizio Gabbrielli, Maria Chiara Meo

Publication date 18 March 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b12316ff3a5118ae76aef00e6d0ec6be09303c38

zbMATH Keywords

semantic scheme

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A theory of observables for logic programs
• Observable Semantics for Constraint Logic Programs
• Fully abstract compositional semantics for an algebra of logic programs
• A compositional semantics for logic programs
• scientific article; zbMATH DE number 176721

Cited in

(13)

• S-semantics for logic programming: a retrospective look
• Abstract interpretation of resolution-based semantics
• The reduced relative power operation on abstract domains
• A compositional semantics for logic programs
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• A theory of observables for logic programs
• Pair-independence and freeness analysis through linear refinement.
• Exploiting parallelism in coalgebraic logic programming
• Deciding the bisimilarity relation between Datalog goals
• Coalgebraic semantics for parallel derivation strategies in logic programming
• Observable Semantics for Constraint Logic Programs
• Quantitative Behavioural Reasoning for Higher-order Effectful Programs
• Witnesses for Answer Sets of Logic Programs

This page was built for publication: Observable behaviors and equivalences of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900312)