Sciweavers

498 search results - page 24 / 100
» Constraint Answer Set Programming Systems
Sort
View
JOTA
2011
104views more  JOTA 2011»
13 years 3 months ago
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
Lingchen Kong, Levent Tunçel, Naihua Xiu
IJCAI
1989
13 years 10 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
AGP
2003
IEEE
14 years 2 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
LPNMR
2001
Springer
14 years 1 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICLP
2010
Springer
14 years 22 days ago
Bisimilarity in Concurrent Constraint Programming
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
Andres A. Aristizabal P.