17 citations · 28 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2018
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…
cs.LO2011★ 9 cited
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…