The Complexity of Abduction for Equality Constraint Languages
From MaRDI portal
Publication:2958548
DOI10.4230/LIPIcs.CSL.2013.615zbMath1356.68223OpenAlexW288912001MaRDI QIDQ2958548
No author found.
Publication date: 2 February 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/4222/pdf/42.pdf
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The Complexity of Counting Quantifiers on Equality Languages ⋮ The complexity of counting quantifiers on equality languages
This page was built for publication: The Complexity of Abduction for Equality Constraint Languages