• Publications
  • Influence
The Inverse Method
TLDR
This book introduces state-of-the-art verification techniques for real time embedded systems, based on the inverse method for parametric timed automata. Expand
  • 87
  • 13
  • PDF
The Undecidability of Simultaneous Rigid E-Unification
Abstract Simultaneous rigid E -unification was introduced in 1987 by Gallier, Raatz and Snyder. It is used in the area of automated reasoning with equality in extension procedures , like the tableauExpand
  • 59
  • 9
Monodic temporal resolution
TLDR
In this paper, we modify and extend the clausal temporal resolution technique, originally developed for propositional temporal logics, to enable its use in monodic FOTL, and provide a complete resolution calculus for formulae in this form. Expand
  • 61
  • 5
  • PDF
Decidability problems for the prenex fragment of intuitionistic logic
  • A. Degtyarev, A. Voronkov
  • Mathematics, Computer Science
  • Proceedings 11th Annual IEEE Symposium on Logic…
  • 27 July 1996
TLDR
We develop a constraint-based technique which allows one to prove decidability and complexity results for sequent calculi. Expand
  • 31
  • 5
Simultaneous rigid E-unification and related algorithmic problems
TLDR
We prove decidability results for fragments of monadic simultaneous rigid E-unification and show the connections between this notion and some algorithmic problems of logic and computer science. Expand
  • 33
  • 4
What You Always Wanted to Know About Rigid E-Unification
TLDR
This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-unification. Expand
  • 20
  • 3
  • PDF
What You Always Wanted to Know about Rigid E-Unification
TLDR
This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-unification. Expand
  • 24
  • 3
Reduction of Second-Order Unification to Simultaneous Rigid E-Unification
The simultaneous rigid E-uni cation problem is used in automated reasoning with equality. In our previous paper we proved the undecidability of this problem by reduction of monadic semiuni cation.Expand
  • 11
  • 3
Equality Reasoning in Sequent-Based Calculi
  • 61
  • 2
Simultaneous Regid E-Unification Is Undecidable
TLDR
We prove the undecidability of the ∃*-fragment of intuitionistic logic with equality and representability of recursively enumerable sets by solutions of simultaneous rigid E-unification. Expand
  • 39
  • 2
...
1
2
3
4
5
...