The Complexity of Minimal Inference Problem for Conservative Constraint Languages

DOI10.1145/3301410zbMath1433.68425OpenAlexW2916261673WikidataQ128351121 ScholiaQ128351121MaRDI QIDQ4633640

Michał Wrona

Publication date: 3 May 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3301410

zbMATH Keywords

computational complexitynonmonotonic reasoningcommonsense reasoningtractabilityalgebraic approachcircumscriptionSchaefer's frameworkminimal inference problem

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The Complexity of Minimal Inference Problem for Conservative Constraint Languages