In Context-oriented Programming (COP), programs can be partitioned into behavioral variations expressed as sets of partial program definitions. Such layers can be activated and de...
Abstract. In this short paper we describe the DFL hybrid knowledge base, that integrates descriptions with expressive object-oriented rules. The knowledge base manages a database o...
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....