scientific article; zbMATH DE number 6747915
From MaRDI portal
Publication:5282991
zbMATH Open1366.68017MaRDI QIDQ5282991FDOQ5282991
Jussi Rintanen, Martin Gebser, Tomi Janhunen
Publication date: 18 July 2017
Full work available at URL: http://ebooks.iospress.nl/volumearticle/36965
Title of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- The Design of the Sixth Answer Set Programming Competition
- Multi-level Algorithm Selection for ASP
- Answer set programming based on propositional satisfiability
- The Seventh Answer Set Programming Competition: Design and Results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Answer Set Programming Modulo Acyclicity
- Backdoors to Normality for Disjunctive Logic Programs
- SAT Modulo Graphs: Acyclicity
- Title not available (Why is that?)
- Design and results of the Fifth Answer Set Programming Competition
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- Logic Programming and Nonmonotonic Reasoning
- Writing Declarative Specifications for Clauses
- Optimizing phylogenetic supertrees using answer set programming
- Backdoors to tractable answer set programming
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Logic for Programming, Artificial Intelligence, and Reasoning
- Learning discrete decomposable graphical models via constraint optimization
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282991)
