Answer set programming by ant colony optimization

DOI10.1007/3-540-45757-7_40MaRDI QIDQ4708941zbMATH OpenFDO

Authors Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Publication date 20 June 2003

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/2424/24240481.htm

Mathematics Subject Classification ID

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

Recommendations

• Answer set programming
• Answer set programming and plan generation
• Answer Set Programming: A Primer
• scientific article; zbMATH DE number 2090539
• Optimum stable model search: algorithms and implementation

Cited in

(2)

• Ant colony programming for approximation problems
• scientific article; zbMATH DE number 2079505 (Why is no real title available?)

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Answer set programming by ant colony optimization

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