scientific article; zbMATH DE number 6747915
From MaRDI portal
Publication:5282991
zbMATH Open1366.68017MaRDI QIDQ5282991FDOQ5282991
Authors: Martin Gebser, Tomi Janhunen, Jussi Rintanen 
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 (25)
- Answer set programming modulo acyclicity
- The Design of the Sixth Answer Set Programming Competition
- Multi-level Algorithm Selection for ASP
- SAT modulo graphs: acyclicity
- 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
- Writing declarative specifications for clauses
- 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
- Optimizing phylogenetic supertrees using answer set programming
- Backdoors to tractable answer set programming
- Answer set programs with queries over subprograms
- Backdoors to normality for disjunctive logic programs
- Stable model semantics for founded bounds
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- What is answer set programming to propositional satisfiability
- Logic for Programming, Artificial Intelligence, and Reasoning
- Learning discrete decomposable graphical models via constraint optimization
- Monotonic Answer Set Programming
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)
