Sciweavers

413 search results - page 52 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
SSD
1997
Springer
154views Database» more  SSD 1997»
15 years 7 months ago
On the Assessment of Generalisation Consistency
Theory, algorithms, techniques and tools for producing a generalisation of a map have long been available. In this paper we study the inverse problem, namely, given two maps L and...
Vasilis Delis, Thanasis Hadzilacos
113
Voted
ECAI
2006
Springer
15 years 7 months ago
Resolving Conflicts in Action Descriptions
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
112
Voted
ESOP
2000
Springer
15 years 7 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
130
Voted
TOOLS
1999
IEEE
15 years 7 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee
151
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...