A generalization of the Lin-Zhao theorem
From MaRDI portal
Publication:854963
DOI10.1007/S10472-006-9025-2zbMATH Open1105.68015OpenAlexW2144198727MaRDI QIDQ854963FDOQ854963
Authors: Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz 
Publication date: 20 December 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-006-9025-2
Recommendations
- A generalization of a theorem of Liao
- scientific article
- A Generalization of Zolotarev's Theorem
- Generalization of a theorem of Luxemburg and Zaanen
- scientific article; zbMATH DE number 1106887
- scientific article; zbMATH DE number 4208452
- scientific article; zbMATH DE number 943258
- A generalization of the Lindelöf theorem
- On a generalization of a result of Zhang and Yang
- A generalization of Lyapounov's theorem
answer set programmingnonmonotonic reasoninglogic programmingstable modelsloop formulasClark's completion
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Nested expressions in logic programs
- The well-founded semantics for general logic programs
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- Circumscription - a form of non-monotonic reasoning
- Title not available (Why is that?)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Title not available (Why is that?)
- Tight logic programs
- Logic Programming
Cited In (18)
- Temporal equilibrium logic: a survey
- A generalization of a theorem of Liao
- IASCAR: incremental answer set counting by anytime refinement
- Stable Models for Temporal Theories
- Metabolic Pathways as Temporal Logic Programs
- Temporal Logic Modeling of Biological Systems
- A general first-order solution to the ramification problem with cycles
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Title not available (Why is that?)
- Syntactic ASP forgetting with forks
- Computationally hard problems for logic programs under answer set semantics
- Relating Two Dialects of Answer Set Programming
- Generalizations on the results of Cao and Zhang
- Logic Programming
- Syntactic ASP forgetting with forks
- Past-present temporal programs over finite traces
Uses Software
This page was built for publication: A generalization of the Lin-Zhao theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854963)
