FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
Abbasizanjani, Hoda	Minimal unsatisfiability and minimal strongly connected digraphs
Achlioptas, Dimitris	Fast Sampling of Perfectly Uniform Satisfying Assignments Fast and Flexible Probabilistic Model Counting
B
Bacchus, Fahiem	MaxSAT Evaluation 2018
Bansal, Sorav	Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition
Becker, Bernd	Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
Berryhill, Ryan	Finding all Minimal Safe Inductive Sets
Beyersdorff, Olaf	Welcome to SAT 2018 Award Ceremony
Bjorner, Nikolaj	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
C
Cimatti, Alessandro	Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
E
Ehlers, Rüdiger	Approximately Propagation Complete and Conflict Propagating Constraint Encodings
Elffers, Jan	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
F
Fichte, Johannes K.	Exploiting Treewidth for Projected Model Counting and its Limits
Friedrich, Tobias	Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT
G
Galesi, Nicola	Cops-Robber games and the resolution of Tseitin formulas
Ganesh, Vijay	Machine Learning-based Restart Policy for CDCL SAT Solvers
Giráldez-Crú, Jesús	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
Gleiss, Bernhard	Local Soundness for QBF Calculi
Gocht, Stephan	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
Griggio, Alberto	Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
Gupta, Shubhani	Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition
H
Hammoudeh, Zayd	Fast Sampling of Perfectly Uniform Satisfying Assignments Fast and Flexible Probabilistic Model Counting
Hecher, Markus	Exploiting Treewidth for Projected Model Counting and its Limits
Heule, Marijn	Computable Short Proofs SAT Competition 2018
Hoos, Holger	Sparkle SAT Challenge 2018
I
Ignatiev, Alexey	PySAT: A Python Toolkit for Prototyping with SAT Oracles
Irfan, Ahmed	Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
Ivrii, Alexander	Finding all Minimal Safe Inductive Sets
J
Jamali, Sima	Centrality-Based Improvements to CDCL Heuristics
Janota, Mikolas	Circuit-based Search Space Pruning in QBF
Järvisalo, Matti	MaxSAT Evaluation 2018 SAT Competition 2018
K
Kauers, Manuel	Symmetries for QBF
Kochemazov, Stepan	ALIAS: A Modular Tool for Finding Backdoors for SAT
Korneev, Svyatoslav	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
Kullmann, Oliver	Minimal unsatisfiability and minimal strongly connected digraphs
L
Lampis, Michael	QBF as an Alternative to Courcelle's Theorem
Li, Chunxiao	Machine Learning-based Restart Policy for CDCL SAT Solvers
Liang, Jia	Machine Learning-based Restart Policy for CDCL SAT Solvers
Luo, Chuan	Sparkle SAT Challenge 2018
M
Mahajan, Anmol	Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition
Marques-Silva, Joao	PySAT: A Python Toolkit for Prototyping with SAT Oracles
Martins, Ruben	MaxSAT Evaluation 2018
Mathews, Minu	Machine Learning-based Restart Policy for CDCL SAT Solvers
Mengel, Stefan	QBF as an Alternative to Courcelle's Theorem
Mitchell, David	Centrality-Based Improvements to CDCL Heuristics
Mitsou, Valia	QBF as an Alternative to Courcelle's Theorem
Morak, Michael	Exploiting Treewidth for Projected Model Counting and its Limits
Morgado, Antonio	PySAT: A Python Toolkit for Prototyping with SAT Oracles
N
Nadel, Alexander	Solving MaxSAT with Bit-Vector Optimization Chronological Backtracking
Narodytska, Nina	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
Nordstrom, Jakob	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
O
Oh, Chanseok	Machine Learning-based Restart Policy for CDCL SAT Solvers
P
Palau Romero, Francisco	Approximately Propagation Complete and Conflict Propagating Constraint Encodings
Paxian, Tobias	Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
Peitl, Tomáš	Polynomial-Time Validation of QCDCL Certificates
Pulina, Luca	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures QBFEVAL’18
R
Reimer, Sven	Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
Roberts, Hannah	XORSAT Set Membership Filters
Rothenberger, Ralf	Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT
Roveri, Marco	Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
Ryvchin, Vadim	Chronological Backtracking
S
Sagiv, Mooly	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
Santhanam, Rahul	Modelling SAT
Saxena, Aseem	Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition
Scholl, Christoph	Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
Sebastiani, Roberto	Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
Seidl, Martina	Symmetries for QBF QBFEVAL’18
Slivovsky, Friedrich	Polynomial-Time Validation of QCDCL Certificates
Smith, Michael	XORSAT Set Membership Filters
Suda, Martin	Local Soundness for QBF Calculi SAT Competition 2018
Szeider, Stefan	Polynomial-Time Validation of QCDCL Certificates
T
Tacchella, Armando	Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
Talebanfard, Navid	Cops-Robber games and the resolution of Tseitin formulas
Theodoropoulos, Panos	Fast Sampling of Perfectly Uniform Satisfying Assignments Fast and Flexible Probabilistic Model Counting
Thomas, Ciza	Machine Learning-based Restart Policy for CDCL SAT Solvers
Toran, Jacobo	Cops-Robber games and the resolution of Tseitin formulas
V
Veneris, Andreas	Finding all Minimal Safe Inductive Sets
Vinyals, Marc	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
W
Weaver, Sean	XORSAT Set Membership Filters
West, Adam	Satalia's SolveEngine
Wintersteiger, Christoph M.	Welcome to SAT 2018 Award Ceremony
Woltran, Stefan	Exploiting Treewidth for Projected Model Counting and its Limits
Z
Zaikin, Oleg	ALIAS: A Modular Tool for Finding Backdoors for SAT

Disclaimer | Powered by EasyChair Smart Program