Sciweavers

804 search results - page 66 / 161
» On the Termination of the Chase Algorithm
Sort
View
89
Voted
ESOP
2008
Springer
15 years 2 months ago
Iterative Specialisation of Horn Clauses
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
93
Voted
EACL
2003
ACL Anthology
15 years 1 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren
100
Voted
SCL
2010
98views more  SCL 2010»
14 years 11 months ago
Symbolic models for nonlinear time-delay systems using approximate bisimulations
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...
TOPNOC
2010
14 years 7 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
118
Voted
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
15 years 10 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen