Sciweavers

1117 search results - page 22 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
AMAI
1999
Springer
13 years 8 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ICDAR
1997
IEEE
14 years 25 days ago
Modeling Documents for Structure Recognition Using Generalized N-Grams
In this paper we present and discuss a novel approach to modeling logical structures of documents, based on a statistical representation of patterns in a document class. An effic...
Rolf Brugger, Abdel Wahab Zramdini, Rolf Ingold
PODS
1989
ACM
129views Database» more  PODS 1989»
14 years 19 days ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
SDB
1995
178views Database» more  SDB 1995»
14 years 4 days ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
AAAI
2007
13 years 11 months ago
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
Katsumi Inoue, Chiaki Sakama