Observable behaviors and equivalences of logic programs

DOI10.1006/INCO.1995.1138zbMath0834.68010OpenAlexW2083731854MaRDI QIDQ1900312

Giorgio Levi, Maria Chiara Meo, Maurizio Gabbrielli

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)

Related Items (10)

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 ⋮ S-semantics for logic programming: a retrospective look ⋮ Abstract interpretation of resolution-based semantics ⋮ The reduced relative power operation on abstract domains ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ A theory of observables for logic programs ⋮ A compositional semantics for logic programs

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