On the configuration of more and less expressive logic programs

DOI10.1017/S1471068422000096MaRDI QIDQ7027215zbMATH OpenFDO

Authors Carmine Dodaro, Marco Maratea, Mauro Vallati

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068422000096

zbMATH Keywords

answer-set programmingknowledge configurationsatisfiability

Mathematics Subject Classification ID

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

Cites work

• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Advanced Portfolio Techniques
• Advances in WASP
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• AI*IA 2013: Advances in artificial intelligence. XIIIth international conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4--6, 2013. Proceedings
• Algorithm runtime prediction: methods \& evaluation
• ASP-Core-2 input language format
• aspeed: solver scheduling via answer set programming
• Automatic construction of parallel portfolios via algorithm configuration
• Conflict-driven answer set solving: from theory to practice
• Dual-normal logic programs -- the forgotten class
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• scientific article; zbMATH DE number 5605058 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 7455711 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• Knowledge Representation, Reasoning and Declarative Problem Solving
• MADS/F-Race: mesh adaptive direct search meets F-Race
• Multi-engine ASP solving with policy adaptation
• Multi-level Algorithm Selection for ASP
• On the impact of configuration on abstract argumentation automated reasoning
• On the importance of domain model configuration for automated planning engines
• Paramils: an automatic algorithm configuration framework
• Pitfalls and best practices in algorithm configuration
• Random forests
• SATenstein: automatically building local search SAT solvers from components
• SATzilla: portfolio-based algorithm selection for SAT
• Semantics and complexity of recursive aggregates in answer set programming
• Some (in)translatability results for normal logic programs and propositional theories
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
• Strongly equivalent logic programs
• Tableau calculi for logic programs under answer set semantics
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• The ASP system DLV2
• The configurable SAT solver challenge (CSSC)
• The intractability of resolution
• The Seventh Answer Set Programming Competition: Design and Results
• The Sixth Answer Set Programming Competition
• Tight logic programs

This page was built for publication: On the configuration of more and less expressive logic programs

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