Evaluation of disjunctive programs in WASP

DOI10.1007/978-3-030-20528-7_18OpenAlexW2945094890MaRDI QIDQ2326731

Carmine Dodaro, Giovanni Amendola, Mario Alviano, Francesco Ricca, Marco Maratea, Nicola Leone

Publication date: 10 October 2019

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

zbMATH Keywords

answer set programmingdisjunctive logic programsanswer set computation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, Enhancing Magic Sets with an Application to Ontological Reasoning, Beyond NP: Quantifying over Answer Sets, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, Unnamed Item, New models for generating hard random Boolean formulas and disjunctive logic programs, A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders, Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

Uses Software

• WASP