Sciweavers

131 search results - page 14 / 27
» Linear Constraint Query Languages: Expressive Power and Comp...
Sort
View
IJAOSE
2010
227views more  IJAOSE 2010»
14 years 8 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose
PODS
2008
ACM
143views Database» more  PODS 2008»
15 years 9 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
88
Voted
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 1 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
NJC
2006
102views more  NJC 2006»
14 years 9 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
VMCAI
2007
Springer
15 years 3 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...