Reasoning about strong inconsistency in ASP

DOI10.1007/978-3-030-51825-7_24OpenAlexW3038213007MaRDI QIDQ2661359

Carlos Mencía, João P. Marques-Silva

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items

ASP and subset minimality: enumeration, cautious reasoning and MUSes, Enumeration of minimal models and MUSes in WASP, Computing smallest MUSes of quantified Boolean formulas

Uses Software

• Clingo
• QUICKXPLAIN