The Complexity of Abduction for Equality Constraint Languages

DOI10.4230/LIPICS.CSL.2013.615MaRDI QIDQ2958548zbMATH OpenOpenAlexFDO

Authors

Publication date 2 February 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2013/4222/pdf/42.pdf

zbMATH Keywords

abductionalgebraic approachcomputational complexityequality-constraint languagesinfinite structures

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• The complexity of equality constraint languages
• The Complexity of Equality Constraint Languages
• scientific article; zbMATH DE number 970711
• scientific article; zbMATH DE number 4166861
• Parameterised complexity of abduction in Schaefer's framework
• Complexity results for abductive logic programming
• Parameterized complexity of abduction in Schaefer's framework
• The complexity of counting quantifiers on equality languages
• The Complexity of Counting Quantifiers on Equality Languages
• Abduction from logic programs: Semantics and complexity

Cited in

(7)

• Parameterised complexity of abduction in Schaefer's framework
• Complexity classifications for propositional abduction in Post's framework
• The Complexity of Counting Quantifiers on Equality Languages
• The complexity of counting quantifiers on equality languages
• Logic Programming
• On Computing Constraint Abduction Answers
• scientific article; zbMATH DE number 970711 (Why is no real title available?)

This page was built for publication: The Complexity of Abduction for Equality Constraint Languages

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