Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Janota, Mikoláš"'
Due to the substantial number of enrollments in programming courses, a key challenge is delivering personalized feedback to students. The nature of this feedback varies significantly, contingent on the subject and the chosen evaluation method. Howeve
Externí odkaz:
http://arxiv.org/abs/2409.07362
The paper deals with the interpretability of Graph Neural Networks in the context of Boolean Satisfiability. The goal is to demystify the internal workings of these models and provide insightful perspectives into their decision-making processes. This
Externí odkaz:
http://arxiv.org/abs/2408.15418
In this work we considerably improve the state-of-the-art SMT solving on first-order quantified problems by efficient machine learning guidance of quantifier selection. Quantifiers represent a significant challenge for SMT and are technically a sourc
Externí odkaz:
http://arxiv.org/abs/2408.14338
Publikováno v:
In the 26th international symposium on Formal Methods, FM 2024
Debugging is one of the most time-consuming and expensive tasks in software development. Several formula-based fault localization (FBFL) methods have been proposed, but they fail to guarantee a set of diagnoses across all failing tests or may produce
Externí odkaz:
http://arxiv.org/abs/2407.09337
In this work, we prove over 3000 previously ATP-unproved Mizar/MPTP problems by using several ATP and AI methods, raising the number of ATP-solved Mizar problems from 75\% to above 80\%. First, we start to experiment with the cvc5 SMT solver which us
Externí odkaz:
http://arxiv.org/abs/2406.17762
Motivated by the recent 10 million dollar AIMO challenge, this paper targets the problem of finding all functions conforming to a given specification. This is a popular problem at mathematical competitions and it brings about a number of challenges,
Externí odkaz:
http://arxiv.org/abs/2404.12048
Automated program analysis is a pivotal research domain in many areas of Computer Science -- Formal Methods and Artificial Intelligence, in particular. Due to the undecidability of the problem of program equivalence, comparing two programs is highly
Externí odkaz:
http://arxiv.org/abs/2307.13014
We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectur
Externí odkaz:
http://arxiv.org/abs/2304.02986
Autor:
Piepenbrock, Jelle, Urban, Josef, Korovin, Konstantin, Olšák, Miroslav, Heskes, Tom, Janota, Mikolaš
The appearance of strong CDCL-based propositional (SAT) solvers has greatly advanced several areas of automated reasoning (AR). One of the directions in AR is thus to apply SAT solvers to expressive formalisms such as first-order logic, for which lar
Externí odkaz:
http://arxiv.org/abs/2210.03590
Computer Science course instructors routinely have to create comprehensive test suites to assess programming assignments. The creation of such test suites is typically not trivial as it involves selecting a limited number of tests from a set of (semi
Externí odkaz:
http://arxiv.org/abs/2207.09509