Extensions of answer set programming
From MaRDI portal
Publication:4906891
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 5485263 (Why is no real title available?)
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- Answer set programming modulo acyclicity
- Hybrid answer set programming
- Encoding Higher Level Extensions of Petri Nets in Answer Set Programming
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- Manifold answer-set programs and their applications
- Achievements in answer set programming
- Automata and Answer Set Programming
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Forward chaining for hybrid ASP
- Characterizing and extending answer set semantics using possibility theory
- An Incremental Answer Set Programming Based System for Finite ModelComputation
- On Cascade Products of Answer Set Programs
- An Introduction to Answer Set Programming and Some of Its Extensions
- Answer set programming modulo acyclicity
- scientific article; zbMATH DE number 5914361 (Why is no real title available?)
- Effectively reasoning about infinite sets in answer set programming
- Towards answer set programming with sorts
- Extensions of answer set programming
- Hybrid ASP
- Beyond NP: quantifying over answer sets
- Answer set programming with graded modality
This page was built for publication: Extensions of answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906891)