Pragmatics of SAT (PoS 2026) [Extended full paper deadline, final call]

Dominik Schreiber via dmanet <[email protected]>
Newsgroups gmane.science.mathematics.discrete
Message-ID <[email protected]>
- Did your nice paper for SAT or a related FLoC conference just get 
rejected?
- Do you have interesting results or ideas related to SAT or other 
constraint
   solving frameworks that you'd like to discuss with other experts?
- Do you have a recently accepted publication along those lines that 
you'd like
   to share and present at FLoC in Lisbon?

If any of this applies to you, consider to go for a last-minute PoS 
submission!
Submit an abstract until May 7 (AOE); the paper submission deadline has been
extended to May 10 (AOE). The updated, final Call for Papers follows.

------------------------------------------------------------------------------------ 


17th International Workshop on Pragmatics of SAT (PoS 2026)
------------------------------------------------------------------------------------ 


The aim of the Pragmatics of SAT (PoS) workshop series is to provide a
venue for researchers working on designing and/or applying Boolean
satisfiability (SAT) solvers and related solver technologies, including but
not restricted to satisfiability modulo theories (SMT), answer set
programming (ASP), and constraint programming (CP) as well as their
optimization counterparts, to meet, communicate, and discuss latest results.

PoS 2026 will be co-located with the 29th International Conference on Theory
and Applications of Satisfiability Testing (SAT 2026) and the Federated 
Logic
Conference (FLoC 2026) in Lisbon, Portugal.

Workshop Website: https://www.pragmaticsofsat.org/2026/
Abstract submission deadline: May 7, 2026
Paper submission deadline: May 10, 2026 (extended, final)
Notification to authors: June 1, 2026
Workshop Date: July 19, 2026

Topics of interest include, but are not limited to:

+ Efficient data structures
+ Techniques for debugging or certifying solvers
+ Visualization of benchmarks structure
+ Monitoring solver behavior
+ Evaluation of solvers
+ Domain specific encodings and heuristics
+ Solver API
+ System and library description
+ New (successful) application of constraint-based technologies
+ New (potential) use cases of constraint-based technologies
+ Constraint solving and machine learning
+ Scaling using multi-core or distributed technology
+ Reflection on past and projection of future of applied SAT research

Submissions must be made electronically, through HotCRP
(https://submissions.floc26.org/pos), as a PDF using the CEURART
one column style (https://ceur-ws.org/Vol-XXX/CEURART.zip).

Submission categories include original papers (including papers submitted to
a main FLoC conference such as SAT that did not make it), work-in-progress
papers (less mature works for which gathering feedback from the community is
desired), and presentation-only submissions (covering recently accepted or
published relevant works).

Submissions will be reviewed by the program committee, which will select a
balanced program of high quality contributions. If a sufficient number of
original papers are accepted for the workshop, we plan to publish the
proceedings of the workshop via CEUR-WS proceedings, possibly by joining
forces with another, related FLoC workshop.

More information is available on the workshop's web page:
https://www.pragmaticsofsat.org/2026/

Bart Bogaerts and Dominik Schreiber (PoS 2026 PC Chairs)
**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   Replies to a  message carried  on DMANET should NOT be
*   addressed to DMANET  but to  the original sender.  The
*   original  sender,  however,  is invited  to prepare an
*   update  of the replies  received and to communicate it
*   via DMANET.
*
*    DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
*      http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.