Logics in Artificial Intelligence
From MaRDI portal
Publication:5394123
DOI10.1007/b100483zbMath1111.68381OpenAlexW335252711MaRDI QIDQ5394123
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100483
Related Items (13)
Equivalence issues in abduction and induction ⋮ Strong order equivalence ⋮ Unnamed Item ⋮ Model-based recasting in answer-set programming ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Unnamed Item ⋮ Solving logic program conflict through strong and weak forgettings ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming ⋮ Program Correspondence under the Answer-Set Semantics: The Non-ground Case
This page was built for publication: Logics in Artificial Intelligence
