#### Filter Results:

- Full text PDF available (59)

#### Publication Year

2002

2019

- This year (7)
- Last 5 years (42)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bruno Buchberger, Adrian Craciun, +8 authors Wolfgang Windsteiger
- J. Applied Logic
- 2006

Theorema is a project that aims at supporting the entire process of mathematical theory exploration within one coherent logic and software system. This survey paper illustrates the style ofâ€¦ (More)

- Temur Kutsia
- AISC
- 2002

A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overviewâ€¦ (More)

- Wolfgang Schreiner, Temur Kutsia, Michael Krieger, Bashar Ahmad, Helmut Otto, Martin Rummerstorfer
- 2014

We present an approach to the runtime monitoring of network traffic for the violation of properties specified in classical predicate logic. The properties are expressed by quantified formulas whichâ€¦ (More)

- Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger
- J. Formalized Reasoning
- 2016

The Theorema project aims at the development of a computer assistant for the working mathematician. Support should be given throughout all phases of mathematical activity, from introducing newâ€¦ (More)

- Besik Dundua, MÃ¡rio Florido, Temur Kutsia
- 2015 17th International Symposium on Symbolic andâ€¦
- 2015

In this paper we introduce Î»R: A foundational calculus for sequence processing with regular expression types. Its term language is the lambda calculus extended with sequences of terms and its typesâ€¦ (More)

- Florina Piroi, Temur Kutsia
- LPAR
- 2005

We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the display and manipulation ofâ€¦ (More)

We present a rule-based Huetâ€™s style anti-unification algorithm for simply-typed lambda-terms, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of theâ€¦ (More)

- Temur Kutsia
- J. Symb. Comput.
- 2007

Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variable can be instantiatedâ€¦ (More)

- Temur Kutsia, Mircea Marin
- LPAR
- 2005

We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. Context and sequenceâ€¦ (More)

- Temur Kutsia
- WWV
- 2005

Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language toâ€¦ (More)