Towards local search for answer sets

DOI10.1007/3-540-45619-8_25MaRDI QIDQ4812972zbMATH OpenFDO

Authors Yannis Dimopoulos, Andreas Sideris

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010363.htm

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Logic Programming
• Answer set programming based on propositional satisfiability
• Logic Programming and Nonmonotonic Reasoning
• ASSAT: computing answer sets of a logic program by SAT solvers
• Conflict-Driven Answer Set Enumeration

Cited in

(9)

• Declarative local search for predicate logic
• Gradient-based supported model computation in vector spaces
• Answer set programming by ant colony optimization
• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Conflict-Driven Answer Set Enumeration
• A Theory of Local Set Queries
• Adaptive large-neighbourhood search for optimisation in answer-set programming

This page was built for publication: Towards local search for answer sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812972)