Quantified constraint handling rules

DOI10.1145/3728640MaRDI QIDQ6939165zbMATH OpenFDO

Authors Vincent Barichard, Igor Stéphan

Publication date 22 August 2025

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3728640

zbMATH Keywords

constraint handling rulesquantified constrained problems

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A First Order Forward Chaining Approach for Answer Set Computing
• An efficient solver for ASP(Q)
• Beyond NP: quantifying over answer sets
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Constraint Handling Rules
• scientific article; zbMATH DE number 1566503 (Why is no real title available?)
• scientific article; zbMATH DE number 1979551 (Why is no real title available?)
• scientific article; zbMATH DE number 1765680 (Why is no real title available?)
• Linear logic
• Linear-logic based analysis of Constraint Handling Rules with disjunction
• Logic Programming
• Logic Programming
• Planning with Incomplete Information in Quantified Answer Set Programming
• Principles and Practice of Constraint Programming – CP 2004
• Resolution for quantified Boolean formulas
• Solving problems in the polynomial hierarchy with ASP(Q)
• Solving quantified constraint satisfaction problems
• Theory and Applications of Satisfiability Testing
• Theory and practice of constraint handling rules
• Value ordering for quantified CSPs
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing

This page was built for publication: Quantified constraint handling rules

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