E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
The organisational specification of a multi-agent system supports agents’ effectiveness in attaining their purpose, or prevent certain undesired behaviour from occurring. This r...
Huib Aldewereld, Virginia Dignum, Catholijn M. Jon...
In the digital age, users can have perfect recall of their digital experiences. In this paper, we explore how this recall can be leveraged during web browsing. We have built a sys...