Predrag Janicic

Learn More
In this paper we address the problem of automated classification of isolates, i.e., the problem of determining the family of genomes to which a given genome belongs. Additionally, we address the problem of automated unsupervised hierarchical clustering of isolates according only to their statistical substring properties. For both of these problems we(More)
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic policies. Despite the outstanding progress in SAT solving in recent years, there is still an appealing lack of techniques for selecting policies appropriate for solving specific input(More)
In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducing cryptanalysis problems to the satisfiability problem. The approach is general, elegant, and does not require any human expertise on the construction of a specific cryptographic function.(More)
We present a theorem prover ArgoCLP based on coherent logic that can be used for generating both readable and formal (machine verifiable) proofs in various theories, primarily geometry. We applied the prover to various axiomatic systems and proved tens of theorems from standard university textbooks on geometry. The generated proofs can be used in different(More)
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware verification. Most of the modern SAT solvers are based on this procedure, extending it with different heuristics. In this paper we present a formal proof that the DPLL procedure is(More)
There are a huge number of problems, from various areas, being solved by reducing them to sat. However, for many applications, translation into sat is performed by specialized, problem-specific tools. In this paper we describe a new system for uniform solving of a wide class of problems by reducing them to sat. The system uses a new specification language(More)
Motivation Motivation SAT/SMT solvers are widely used, but encoding to SAT/SMT is typically made by special-purpose tools There are interchange formats for SAT/SMT (e.g., SMT-lib) but no high-level specification languages Goal: Build a new modelling and solving system (for CSP, verification problems, etc.) with: simple but expressible, high-level(More)
Chess endgame strategies in a concise and intuitive way describe the rules the player should follow to ensure win (or draw). Endgame strategies are useful for both computer and human players. Their correctness can be proved in several ways, and in this paper we present one of them: computer assisted proof based on reduction to propositional logic, more(More)