Computing weighted solutions in ASP: representation-based method vs. search-based method
From MaRDI portal
Publication:421455
DOI10.1007/s10472-011-9242-1zbMath1402.68031OpenAlexW2075438353MaRDI QIDQ421455
Esra Erdem, Halit Erdogan, Duygu Cakmak
Publication date: 23 May 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-011-9242-1
Problems related to evolution (92D15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- The computational complexity of inferring rooted phylogenies by parsimony
- Prioritized logic programming and its application to commonsense reasoning
- Extending and implementing the stable model semantics
- Nested expressions in logic programs
- Inferring phylogenetic trees using answer set programming
- A Constructive semantic characterization of aggregates in answer set programming
- Design and implementation of aggregate functions in the DLV system
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Computing Weighted Solutions in Answer Set Programming
- Logic Programming for Multiagent Planning with Negotiation
- Weight constraints as nested expressions
- Computing preferred answer sets by meta-interpretation in Answer Set Programming
- Finding similar/diverse solutions in answer set programming
- Conflict-Driven Answer Set Enumeration
- A machine program for theorem-proving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Computational Science – ICCS 2005
This page was built for publication: Computing weighted solutions in ASP: representation-based method vs. search-based method
