Sciweavers

2573 search results - page 336 / 515
» Combinations of Modal Logics
Sort
View
EACL
2003
ACL Anthology
15 years 8 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
IJCAI
2001
15 years 8 months ago
Mining Soft-Matching Rules from Textual Data
Text mining concerns the discovery of knowledge from unstructured textual data. One important task is the discovery of rules that relate specific words and phrases. Although exist...
Un Yong Nahm, Raymond J. Mooney
AAAI
1996
15 years 7 months ago
Reasoning about Continuous Processes
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
Christoph S. Herrmann, Michael Thielscher
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 7 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
AICOM
2010
127views more  AICOM 2010»
15 years 6 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...