scientific article; zbMATH DE number 6747915
From MaRDI portal
Publication:5282991
Recommendations
Cited in
(27)- Monotonic Answer Set Programming
- 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
- A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
- The Seventh Answer Set Programming Competition: Design and Results
- Aggregate semantics for propositional answer set programs
- Answer set programming modulo acyclicity
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- scientific article; zbMATH DE number 1884403 (Why is no real title available?)
- Writing declarative specifications for clauses
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- 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
- What is answer set programming to propositional satisfiability
- Stable model semantics for founded bounds
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Learning discrete decomposable graphical models via constraint optimization
- 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)
