Sciweavers

2529 search results - page 124 / 506
» The Logical Structure of Binding
Sort
View
LPAR
2010
Springer
15 years 4 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
LICS
2000
IEEE
15 years 10 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
SOFSEM
1998
Springer
15 years 10 months ago
Determining Type of TIL Construction with Verb Valency Analyser
In our paper we discuss an approach to semiautomatic corpus processing aimed at analysing verb valencies in Czech and consecutive determining the type of TIL (Transparent Intension...
Pavel Smrz, Ales Horák
APAL
2006
112views more  APAL 2006»
15 years 6 months ago
On complexity of verification of interacting agents' behavior
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky