Evaluation of disjunctive programs in WASP

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

Carmine Dodaro, Giovanni Amendola, M. Alviano, F. Ricca, Marco Maratea, N. 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 programming (68N17) Logic in artificial intelligence (68T27)

Cited In (10)

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

Uses Software

• WASP

This page was built for publication: Evaluation of disjunctive programs in WASP

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