Dear all,

📓 This is the official account of the Constraints Journal (https://link.springer.com/journal/10601).

📣 We will use this account to notify you of new publications, extra materials, CfPs and special issues.

💬 We look forward to connecting with the CP community, and thank ACM for hosting.

🚀 Please boost, tnx!

#AcademicMastodon
#ArtificialIntelligence
#AutomatedReasoning
#CombinatorialAlgorithms
#ComputationalLogic
#ConstraintProgramming
#OperationsResearch
#Optimisation
#Satisfiability

'Critically Assessing the State of the Art in Neural Network Verification', by Matthias König, Annelot W. Bosman, Holger H. Hoos, Jan N. van Rijn.

http://jmlr.org/papers/v25/23-0119.html

#robustness #benchmarks #satisfiability

Weekend project: try to solve some #combinatorics #enumeration problems by reduction to #SharpSAT. (Which, to be clear, I thought was unlikely to succeed!)

I picked c2d http://reasoning.cs.ucla.edu/c2d/ because it scored highly in the 2020 Model Counting Competition https://arxiv.org/abs/2012.01323 but I am not sure this is the same version. The one I got is dated 2005 and was 32-bit only. It ran out of memory on this 364-variable 942-clause instance (corresponding to 6 playing cards chosen from a standard 52-card deck.)

Looking at the 2023 competition instead, I think I should try SharpSAT-TD https://github.com/Laakeri/sharpsat-td but it is not as well documented. For example, I don't know if it supports the "eclauses" (exactly-one clauses) extension of the Dimacs CNF format.

#Satisfiability

Breakfast? check ✔️
Coffee? check ✔️
Submission to SAT fast track? DO IT NOW! (or forever wish you had)

https://cp2023.a4cp.org/cfp.html

#ConstraintProgramming #CallForPapers #ArtificialIntelligence #CP2023 #AcademicMastodon #AcademicChatter #Satisfiability

There is still time to submit the abstract of your paper in the SAT fast track. Check out the Call for Papers for more details: https://cp2023.a4cp.org/cfp.html

#ConstraintProgramming #CP2023 #CallForPapers #deadline #Satisfiability #AcademicMastodon #AcademicChatter #ArtificialIntelligence

BREAKING: the requirements for submission to our SAT fast track have just been *relaxed*.

Check out our updated Call for Papers (https://cp2023.a4cp.org/cfp.html) to see if your SAT paper qualifies.

#Satisfiability #ConstraintProgramming #deadline #CallForPapers #CP2023conf #AcademicMastodon #AcademicChatter #CP2023

Introduction to Logic
(2013) : Genesereth, Michal Kao, Eric
DOI: https://doi.org/10.2200/S00518ED2V01Y201306CSL006
#propositional_logic #proof #logic #relational_logic #text_book #induction #satisfiability #resolution #my_bibtex

Papers that were sadly not accepted to SAT 2023, can be revised and submitted to CP 2023 in a special fast track:

- SAT fast track abstract registration: May 1, 2023
- SAT fast track paper submission: May 17, 2023

#Satisfiability #AI #CP2023 #CfP #ConstraintProgramming #AcademicMastodon #CFP #CallForPapers

The SMT-LIBv2 Language and Tools: A Tutorial
(2013) : David R. Cok
url: http://www.grammatech.com/resource/smt/SMTLIBTutorial.pdf
#SMT #SMT_LIB #lisp #logic #satisfiability #theories #validity
#my_bibtex

Answer Set Programming Based on Propositional Satisfiability
(2007) : Giunchiglia, Enrico
DOI: https://doi.org/10.1007/s10817-006-9033-2
#ASP #ansprolog #presentation #programming #satisfiability
#my_bibtex