Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics

DOI10.1007/3-540-45402-0_25MaRDI QIDQ4798019zbMATH OpenFDO

Authors Thomas Lukasiewicz

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2173/21730336.htm

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Many-valued disjunctive logic programs with probabilistic semantics
• A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
• The least fixpoint transformation for disjunctive logic programs
• scientific article; zbMATH DE number 25192
• A simple fixed point characterization of three-valued stable model semantics

Cited in

(4)

• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Termination of logic programs with imperfect information: applications and query procedure
• Many-valued disjunctive logic programs with probabilistic semantics
• Possibilistic uncertainty handling for answer set programming

This page was built for publication: Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics

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