Extensions of answer set programming

zbMATH Open1259.68025MaRDI QIDQ4906891FDOQ4906891

Authors: Wiktor Marek, Jeffrey Remmel 

Publication date: 28 February 2013

Recommendations

• Answer Set Programming: A Primer
• Logic Programming and Nonmonotonic Reasoning
• Extensions of answer set programming
• Integrating answer set programming and constraint logic programming
• Answer sets for logic programs with arbitrary abstract constraint atoms

zbMATH Keywords

set-based logic programmingarbitrary constraint logic programminghybrid answer set programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (23)

• Hybrid answer set programming
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
• Answer set programming modulo acyclicity
• Automata and Answer Set Programming
• An Incremental Answer Set Programming Based System for Finite ModelComputation
• Effectively reasoning about infinite sets in answer set programming
• Title not available (Why is that?)
• Characterizing and extending answer set semantics using possibility theory
• Title not available (Why is that?)
• Achievements in answer set programming
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• On Cascade Products of Answer Set Programs
• Towards answer set programming with sorts
• Answer set programming with graded modality
• Answer set programming modulo acyclicity
• Manifold answer-set programs and their applications
• Extensions of answer set programming
• Hybrid ASP
• An Introduction to Answer Set Programming and Some of Its Extensions
• Beyond NP: quantifying over answer sets
• Title not available (Why is that?)
• Forward chaining for hybrid ASP
• Encoding Higher Level Extensions of Petri Nets in Answer Set Programming

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)