The expressive power of unique total stable model semantics

DOI10.1007/3-540-63165-8_237zbMATH Open1401.68027OpenAlexW1502477797MaRDI QIDQ4572012FDOQ4572012

Sergio Greco, Domenico Saccà, Francesco Buccafurri

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_237

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• Autoepistemic logic
• Relative complexity of checking and evaluating
• Structure and complexity of relational queries
• Why not negation by fixpoint?
• On the unique satisfiability problem
• Multiple total stable models are definitely needed to solve unique solution problems
• ``Possible is certain is desirable and can be expressive
• On non-determinism in machines and languages

Cited In (2)

• Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
• Extending and implementing the stable model semantics

This page was built for publication: The expressive power of unique total stable model semantics

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