Sciweavers

565 search results - page 106 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
JIDM
2010
160views more  JIDM 2010»
13 years 6 months ago
Evaluation of Conditional Preference Queries
The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines....
Fabiola S. F. Pereira, Sandra de Amo
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna