Days: Monday, July 14th Tuesday, July 15th Wednesday, July 16th Thursday, July 17th
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | Welcome Address by the Rector (abstract) |
08:50 | Welcome Address by the Organizers (abstract) |
08:55 | VSL Opening (abstract) |
09:15 | VSL Keynote Talk: Computational Ideas and the Theory of Evolution (abstract) |
10:45 | Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (abstract) |
11:15 | Solving MaxSAT and #SAT on structured CNF formulas (abstract) |
11:45 | Cores in Core based MaxSat Algorithms: an Analysis (abstract) |
12:10 | On Computing Preferred MUSes and MCSes (abstract) |
12:40 | MUS Extraction using Clausal Proofs (abstract) |
14:30 | Fixed-parameter tractable reductions to SAT (abstract) |
15:00 | On Reducing Maximum Independent Set to Minimum Satisfiability (abstract) |
15:30 | Conditional Lower Bounds for Failed Literals and Related Techniques (abstract) |
16:30 | MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (abstract) |
16:50 | DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (abstract) |
17:10 | Automatic Evaluation of Reductions between NP-complete Problems (abstract) |
17:30 | Open-WBO: a Modular MaxSAT Solver (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
View this program: with abstractssession overviewtalk overviewside by side with other conferences
10:45 | Long Proofs of (Seemingly) Simple Formulas (abstract) |
11:15 | Proof complexity and the Lovasz-Kneser Theorem (abstract) |
11:50 | Ultimately Incremental SAT (abstract) |
12:20 | Community Branching for Parallel Portfolio SAT Solvers (abstract) |
12:40 | Lazy clause exchange policy for parallel SAT solvers (abstract) |
14:30 | A (Biased) Proof Complexity Survey for SAT Practitioners (abstract) |
15:30 | Unified characterisations of resolution hardness measures (abstract) |
16:30 | QBF Resolution Systems and their Proof Complexities (abstract) |
19:00 | VSL Public Lecture: Gödel in Vienna (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
10:45 | A SAT Attack on the Erdos Discrepancy Conjecture (abstract) |
11:05 | Dominant Controllability Check Using QBF-Solver and Netlist Optimizer (abstract) |
11:35 | Fast DQBF Refutation (abstract) |
08:45 | VSL Keynote Talk: The theory and applications of o-minimal structures (abstract) |
12:00 | Variable Dependencies and Q-Resolution (abstract) |
12:30 | Impact of Community Structure on SAT Solver Performance (abstract) |
14:30 | A Model-Constructing Satisfiability Calculus (abstract) |
15:30 | Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses (abstract) |
16:30 | Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) (abstract) |
17:00 | Simplifying Pseudo-Boolean Constraints in Residual Number Systems (abstract) |
17:30 | Detecting cardinality constraints in CNF (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | FLoC Panel: Publication Models in Computing Research: Is a Change Needed? Are We Ready for a Change? (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
View this program: with abstractssession overviewtalk overviewside by side with other conferences
10:45 | Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (abstract) |
11:15 | An Ising Model inspired Extension of the Product-based MP Framework for SAT (abstract) |
11:45 | Approximating highly satisfiable random 2-SAT (abstract) |
12:15 | Hypergraph Acyclicity and Propositional Model Counting (abstract) |
16:30 | Foundations and Technology Competitions Award Ceremony (abstract) |
17:30 | FLoC Olympic Games Award Ceremony 1 (abstract) |
18:15 | FLoC Closing Week 1 (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:00 | FLoC Olympic Games Big Screen: OWL Reasoner Evaluation (ORE 2014) (abstract) |
09:00 | FLoC Olympic Games Big Screen: Satisfiability Modulo Theories solver competition (SMT-COMP 2014) (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | FLoC Plenary Talk: Electronic voting: how logic can help? (abstract) |
10:15 | FLoC Olympic Games Big Screen: 7th IJCAR ATP System Competition (CASC-J7) (abstract) |
10:15 | FLoC Olympic Games Big Screen: Termination Competition (termCOMP 2014) (abstract) |
14:30 | FLoC Olympic Games: Answer Set Programming Modeling Competition 2014 (abstract) |