Sciweavers

2273 search results - page 36 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
PAAMS
2010
Springer
13 years 6 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
CADE
2002
Springer
14 years 8 months ago
Reasoning with Expressive Description Logics: Theory and Practice
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
Ian Horrocks
ISSAC
2005
Springer
94views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Domains and expressions: an interface between two approaches to computer algebra
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
Cosmin E. Oancea, Stephen M. Watt
AAAI
2008
13 years 10 months ago
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter