Abstract: Signal temporal logic (STL) provides a powerful, flexible framework for specifying complex autonomy tasks; however, existing methods for planning based on STL specifications have difficulty ...

Abstract: We developed an algorithm for inferring controller logic for cyber-physical systems (CPS) in the form of a state machine from given execution traces and linear temporal logic formulas. The ...

This is a preview. Log in through your library . Abstract I survey Brouwer's weak counterexamples to classical theorems, with a view to discovering (i) what useful mathematical work is done by weak ...

This is the implementation of Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localization [1] accepted at AAAI 2025. In this work, we propose a novel approach ...

This is a preview. Log in through your library . Abstract We construct a counterexample to the "hot spots" conjecture; there exists a bounded connected planar domain (with two holes) such that the ...

In the article, the authors harness recent advances in incremental answer set solving for developing effective algorithms for reasoning tasks in the logic programming fragment of assumption-based ...

Quantified Boolean Formulas (QBF) extend classical Boolean logic by incorporating quantifiers over Boolean variables, thereby enabling the expression of problems in the PSPACE complexity class. The ...