Sciweavers

279 search results - page 3 / 56
» Constructive Interval Disjunction
Sort
View
KR
2004
Springer
15 years 2 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
DATE
1998
IEEE
92views Hardware» more  DATE 1998»
15 years 1 months ago
Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya
ASP
2003
Springer
15 years 2 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
JCO
2010
79views more  JCO 2010»
14 years 4 months ago
New error-correcting pooling designs associated with finite vector spaces
Let Fn q be a n-dimensional vector space over Fq. In this paper we construct a new family of inclusion matrices associated with subspaces of Fn q, and exhibit their disjunct proper...
Jizhu Nan, Jun Guo
CP
2003
Springer
15 years 2 months ago
Box Constraint Collections for Adhoc Constraints
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey