A generalization of the Lin-Zhao theorem

DOI10.1007/S10472-006-9025-2MaRDI QIDQ854963zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

answer set programmingnonmonotonic reasoninglogic programmingstable modelsloop formulasClark's completion

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• A generalization of a theorem of Liao
• scientific article; zbMATH DE number 1186842
• 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

Cites work

• scientific article; zbMATH DE number 5910656 (Why is no real title available?)
• scientific article; zbMATH DE number 949290 (Why is no real title available?)
• scientific article; zbMATH DE number 2085248 (Why is no real title available?)
• ASSAT: computing answer sets of a logic program by SAT solvers
• Circumscription - a form of non-monotonic reasoning
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Nested expressions in logic programs
• The well-founded semantics for general logic programs
• Tight logic programs

Cited in

(20)

• Temporal equilibrium logic: a survey
• A generalization of a theorem of Liao
• Relating two dialects of answer set programming
• IASCAR: incremental answer set counting by anytime refinement
• Stable Models for Temporal Theories
• 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
• First-order stable model semantics and first-order loop formulas
• scientific article; zbMATH DE number 6001272 (Why is no real title available?)
• Temporal logic modeling of biological systems
• Syntactic ASP forgetting with forks
• Computationally hard problems for logic programs under answer set semantics
• Why are there so many loop formulas?
• Generalizations on the results of Cao and Zhang
• Logic Programming
• Syntactic ASP forgetting with forks
• Metabolic pathways as temporal logic programs
• Past-present temporal programs over finite traces

Describes a project that uses

Uses Software

• Cmodels
• ASSAT

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)