Efficient solving of time-dependent answer set programs

DOI10.4230/LIPICS.ICLP.2010.64MaRDI QIDQ2883077zbMATH OpenOpenAlexFDO

Authors Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, C. Cornelis, Martine De Cock

Publication date 11 May 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_af48.html

zbMATH Keywords

answer set programminggene regulation networkstime-dependent programs

Mathematics Subject Classification ID

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

Recommendations

• Temporal answer set programming
• Towards metric temporal answer set programming
• Towards dynamic answer set programming over finite traces
• Reactive answer set programming
• Finding State Solutions to Temporal Logic Queries

Cited in

(4)

• Efficient Temporal Satisfiability
• Solving non-linear constraint satisfaction problems involving time-dependent functions
• Metric temporal answer set programming over timed traces
• Integrating Temporal Extensions of Answer Set Programming

This page was built for publication: Efficient solving of time-dependent answer set programs

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