FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

Disclaimer | Powered by EasyChair Smart Program