The expressive power of ``possible-is-certain semantics (extended abstract)

DOI10.1007/BFB0027777zbMATH Open1541.68068MaRDI QIDQ6560352FDOQ6560352

Authors: Sergio Greco, Domenico Saccà 

Publication date: 21 June 2024

Recommendations

• ``Possible is certain is desirable and can be expressive
• Functional queries in datalog
• The expressive powers of stable models for bound and unbound DATALOG queries
• scientific article; zbMATH DE number 1114053
• The expressive power of unique total stable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• Computable queries for relational data bases
• Title not available (Why is that?)
• Datalog extensions for database queries and updates
• Autoepistemic logic
• Languages that Capture Complexity Classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structure and complexity of relational queries
• Why not negation by fixpoint?
• Extrema predicates in deductive databases
• The expressive powers of stable models for bound and unbound DATALOG queries

This page was built for publication: The expressive power of ``possible-is-certain semantics (extended abstract)

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