Sciweavers

120 search results - page 19 / 24
» Disjunctive Logic Programming and Autoepistemic Logic
Sort
View
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 9 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
MICAI
2000
Springer
13 years 10 months ago
Knowledge Representation Using High-Level Non-monotonic Reasoning
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
Mauricio Osorio, Juan Carlos Nieves, Fernando Zaca...
LPKR
1997
Springer
13 years 11 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
AI
2010
Springer
13 years 7 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
ICLP
2010
Springer
13 years 11 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto