Combinatorial optimization and reasoning with graph neural networks
Combinatorial optimization is a well-established area in operations research and computer
science. Until recently, its methods have focused on solving problem instances in isolation …
science. Until recently, its methods have focused on solving problem instances in isolation …
The science of brute force
MJH Heule, O Kullmann - Communications of the ACM, 2017 - dl.acm.org
The science of brute force Page 1 70 COMMUNICATIONS OF THE ACM | AUGUST 2017 |
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
Theory solving made easy with clingo 5
M Gebser, R Kaminski, B Kaufmann… - … of the 32nd …, 2016 - drops.dagstuhl.de
Abstract Answer Set Programming (ASP) is a model, ground, and solve paradigm. The
integration of application-or theory-specific reasoning into ASP systems thus impacts on …
integration of application-or theory-specific reasoning into ASP systems thus impacts on …
[图书][B] Answer set solving in practice
Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …
Solving and verifying the boolean pythagorean triples problem via cube-and-conquer
Abstract The boolean Pythagorean Triples problem has been a longstanding open problem
in Ramsey Theory: Can the set N={1, 2,\dots\} of natural numbers be divided into two parts …
in Ramsey Theory: Can the set N={1, 2,\dots\} of natural numbers be divided into two parts …
On the glucose SAT solver
G Audemard, L Simon - International Journal on Artificial …, 2018 - World Scientific
The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …
for practical SAT solving. In this paper, we review the different strategies and technologies …
[PDF][PDF] Potassco: The Potsdam answer set solving collection
M Gebser, B Kaufmann, R Kaminski, M Ostrowski… - Ai …, 2011 - Citeseer
Potassco: The Potsdam Answer Set Solving Collection Page 1 AI Communications 24 (2011)
107–124 107 DOI 10.3233/AIC-2011-0491 IOS Press Potassco: The Potsdam Answer Set …
107–124 107 DOI 10.3233/AIC-2011-0491 IOS Press Potassco: The Potsdam Answer Set …
Conflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts
successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in …
successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in …
DRAT-trim: Efficient checking and trimming using expressive clausal proofs
The DRAT-trim tool is a satisfiability proof checker based on the new DRAT proof format.
Unlike its predecessor, DRUP-trim, all presently known SAT solving and preprocessing …
Unlike its predecessor, DRUP-trim, all presently known SAT solving and preprocessing …
Solving non-linear arithmetic
D Jovanović, L De Moura - ACM Communications in Computer Algebra, 2013 - dl.acm.org
We propose a new decision procedure for the existential theory of the reals. It performs a
backtracking search for a model in R, where the backtracking is powered by a novel conflict …
backtracking search for a model in R, where the backtracking is powered by a novel conflict …