19 citations · 53 across the 10 of their papers we have counts for
10 papers
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
Predrag Janičić
We propose a novel framework for developing, analyzing, and validating reductions between NP-complete problems. Powered by the SAT-based constraint solver URSA, our methodology int…
Automated Generation of Illustrations for Synthetic Geometry Proofs
Predrag Janičić, Julien Narboux
We report on a new, simple, modular, and flexible approach for automated generation of illustrations for (readable) synthetic geometry proofs. The underlying proofs are generated u…
Proceedings of the 13th International Conference on Automated Deduction in Geometry
Predrag Janičić, Zoltán Kovács
Automated Deduction in Geometry (ADG) is a forum to exchange ideas and views, to present research results and progress, and to demonstrate software tools at the intersection betwee…
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture
Predrag Janičić, Filip Marić, Marko Maliković
There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one com…
A Vernacular for Coherent Logic
Sana Stojanovic, Julien Narboux, Marc Bezem +1
We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rule…
Towards Understanding Triangle Construction Problems
Vesna Marinkovic, Predrag Janicic
Straightedge and compass construction problems are one of the oldest and most challenging problems in elementary mathematics. The central challenge, for a human or for a computer p…
Formalization and Implementation of Algebraic Methods in Geometry
Filip Marić, Ivan Petrović, Danijela Petrović +1
We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method), their implementation and integration…
Formalization of Abstract State Transition Systems for SAT
Filip Maric, Predrag Janicic
We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations o…
Simple Algorithm Portfolio for SAT
Mladen Nikolic, Filip Maric, Predrag Janicic
The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzi…
URSA: A System for Uniform Reduction to SAT
Predrag Janicic
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, pro…