Logic Programming and Nonmonotonic Reasoning

DOI10.1007/11546207MaRDI QIDQ5473976zbMATH OpenOpenAlexFDO

Authors Wolfgang Faber, F. Ricca

Publication date 23 June 2006

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

Full work available at URL https://doi.org/10.1007/11546207

Mathematics Subject Classification ID

Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Experimenting with Look-Back Heuristics for Hard ASP Programs
• On look-ahead heuristics in disjunctive logic programming
• Beyond NP: quantifying over answer sets
• The ASP system DLV2
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

Cited in

(9)

• ASP programs with groundings of small treewidth
• On look-ahead heuristics in disjunctive logic programming
• Look-back techniques for ASP programs with aggregates
• Partitions on bigrams and Markov property of block ciphers
• Permutation homomorphisms of block ciphers and \({\otimes_{\mathbf{W}}} \)-Markovian property
• Multi-level Algorithm Selection for ASP
• scientific article; zbMATH DE number 7455702 (Why is no real title available?)
• Beyond NP: quantifying over answer sets
• Experimenting with Look-Back Heuristics for Hard ASP Programs

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Logic Programming and Nonmonotonic Reasoning

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