Sciweavers

662 search results - page 5 / 133
» Logic Programming with Ordered Disjunction
Sort
View
NMELP
1994
13 years 11 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
AAAI
2006
13 years 8 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
ACL
1990
13 years 8 months ago
Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
Mark Johnson
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 20 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
LANMR
2007
13 years 9 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...