Sciweavers

2273 search results - page 22 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
EACL
2003
ACL Anthology
13 years 9 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ä
AMAI
2004
Springer
14 years 1 months ago
The Expressive Rate of Constraints
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
Hubie Chen
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
LPAR
1999
Springer
14 years 21 days ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
CEC
2003
IEEE
14 years 2 days ago
Dynamics of gene expression in an artificial genome
Abstract- Complex systems techniques provide a powerful tool to study the emergent properties of networks of interacting genes. In this study we extract models of genetic regulator...
Kai Willadsen, Janet Wiles