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

DOI10.1007/BFB0027777MaRDI QIDQ6560352zbMATHFDO

Authors Sergio Greco, Domenico Saccà

Publication date 21 June 2024

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• Autoepistemic logic
• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• Extrema predicates in deductive databases
• Languages that Capture Complexity Classes
• Structure and complexity of relational queries
• The expressive powers of stable models for bound and unbound DATALOG queries
• The well-founded semantics for general logic programs
• Why not negation by fixpoint?

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)