93 search results - page 7 / 19 » Nonterminal Complexity of Some Operations on Context-Free La... |
MODELS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
Many existing software applications involve complex application layer implemented in OO programming languages and at the same time use relational database systems as back-end data...
IJCAI
2003
13 years 9 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
CICLING
2003
Springer
14 years 23 days ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...