| Publication | Date of Publication | Type |
|---|
Breaking symmetries with high dimensional graph invariants and their combination
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
Constraints | 2022-07-07 | Paper |
Constraints for symmetry breaking in graph representation
Constraints | 2019-10-25 | Paper |
Sorting networks: to the end and back again
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Efficient analysis of concurrent constraint logic programs
Automata, Languages and Programming | 2019-03-29 | Paper |
| Breaking symmetries with lex implications | 2018-07-09 | Paper |
Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
| Graphs with girth at least 5 with orders between 20 and 32 | 2017-08-22 | Paper |
Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
Constraints | 2017-08-16 | Paper |
Breaking symmetries in graph search with canonizing sets
Constraints | 2017-08-16 | Paper |
Optimal-depth sorting networks
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Sorting networks: the end game
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Sorting nine inputs requires twenty-five comparisons
Journal of Computer and System Sciences | 2015-12-30 | Paper |
A novel SAT-based approach to model based diagnosis
The Journal of Artificial Intelligence Research (JAIR) | 2014-11-13 | Paper |
Simplifying pseudo-Boolean constraints in residual number systems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
SAT solving for termination proofs with recursive path orders and dependency pairs
Journal of Automated Reasoning | 2013-08-01 | Paper |
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research | 2013-04-09 | Paper |
Compiling finite domain constraints to SAT with BEE
Theory and Practice of Logic Programming | 2013-03-13 | Paper |
SAT-based termination analysis using monotonicity constraints over the integers
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
Optimal base encodings for pseudo-Boolean constraints
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Inferring termination conditions for logic programs using backwards analysis
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Pairwise cardinality networks
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Lazy abstraction for size-change termination
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Propagation via lazy clause generation
Constraints | 2009-08-06 | Paper |
| Solving partial order constraints for LPO termination | 2009-04-14 | Paper |
Proving Termination with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation | 2009-01-22 | Paper |
Solving Partial Order Constraints for LPO Termination
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Proving Termination Using Recursive Path Orders and SAT Solving
Frontiers of Combining Systems | 2008-09-16 | Paper |
Propagation = Lazy Clause Generation
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
SAT Solving for Argument Filterings
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
A SAT-Based Approach to Size Change Termination with Global Ranking Functions
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Logic programming with satisfiability
Theory and Practice of Logic Programming | 2008-01-21 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Oracle semantics for Prolog
Information and Computation | 2006-10-10 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Inferring termination conditions for logic programs using backwards analysis
Theory and Practice of Logic Programming | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2086511 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2085274 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2084361 (Why is no real title available?) | 2004-08-06 | Paper |
Worst-case groundness analysis using definite Boolean functions
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1953275 (Why is no real title available?) | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1948414 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1761885 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1692955 (Why is no real title available?) | 2002-01-21 | Paper |
A semantic basis for the termination analysis of logic programs
The Journal of Logic Programming | 2000-11-22 | Paper |
A simple polynomial groundness analysis for logic programs
The Journal of Logic Programming | 2000-10-10 | Paper |
Type dependencies for logic programs using ACI-unification
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1487945 (Why is no real title available?) | 2000-08-10 | Paper |
Improving program analyses, by structure untupling
The Journal of Logic Programming | 2000-05-07 | Paper |
An algebraic approach to sharing analysis of logic programs
The Journal of Logic Programming | 2000-02-06 | Paper |
Efficient goal directed bottom-up evaluation of logic programs
The Journal of Logic Programming | 2000-01-04 | Paper |
Worst-case groundness analysis using positive Boolean functions
The Journal of Logic Programming | 2000-01-04 | Paper |
| scientific article; zbMATH DE number 1222415 (Why is no real title available?) | 1998-11-11 | Paper |
| scientific article; zbMATH DE number 1088021 (Why is no real title available?) | 1998-06-11 | Paper |
A confluent semantic basis for the analysis of concurrent constraint logic programs
The Journal of Logic Programming | 1998-03-17 | Paper |
Exploiting goal independence in the analysis of logic programs
The Journal of Logic Programming | 1998-03-16 | Paper |
Semantics-based program analysis for logic-based languages using XSB
International Journal on Software Tools for Technology Transfer. STTT | 1998-01-01 | Paper |
On the design of a correct freeness analysis for logic programs
The Journal of Logic Programming | 1997-04-27 | Paper |
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
The Journal of Logic Programming | 1997-04-17 | Paper |
Proving implications by algebraic approximation
Theoretical Computer Science | 1997-02-27 | Paper |
Bottom-up abstract interpretation of logic programs
Theoretical Computer Science | 1994-04-05 | Paper |
Modelling Prolog Control
Journal Of Logic And Computation | 1994-03-27 | Paper |
Specialisation of Prolog and FCP programs using abstract interpretation
New Generation Computing | 1988-01-01 | Paper |
Compiling OR-parallelism into AND-parallelism
New Generation Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3958714 (Why is no real title available?) | 1986-01-01 | Paper |
