scientific article; zbMATH DE number 6747915
From MaRDI portal
Publication:5282991
Recommendations
Cited in
(25)- Backdoors to tractable answer set programming
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Stable model semantics for founded bounds
- Answer set programming modulo acyclicity
- Multi-level Algorithm Selection for ASP
- The Seventh Answer Set Programming Competition: Design and Results
- Answer set programs with queries over subprograms
- SAT modulo graphs: acyclicity
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- Backdoors to normality for disjunctive logic programs
- Answer set programming based on propositional satisfiability
- The Design of the Sixth Answer Set Programming Competition
- Logic Programming and Nonmonotonic Reasoning
- Design and results of the Fifth Answer Set Programming Competition
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- scientific article; zbMATH DE number 1884403 (Why is no real title available?)
- Answer set programming modulo acyclicity
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Optimizing phylogenetic supertrees using answer set programming
- Writing declarative specifications for clauses
- What is answer set programming to propositional satisfiability
- Monotonic Answer Set Programming
- Learning discrete decomposable graphical models via constraint optimization
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
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)
