Sciweavers

740 search results - page 53 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
POPL
2004
ACM
14 years 9 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
HIPC
2003
Springer
14 years 2 months ago
Thread Migration/Checkpointing for Type-Unsafe C Programs
Thread migration/checkpointing is becoming indispensable for load balancing and fault tolerance in high performance computing applications, and its success depends on the migration...
Hai Jiang, Vipin Chaudhary
ICLP
2004
Springer
14 years 2 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
APAL
2005
135views more  APAL 2005»
13 years 9 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
JOTA
2011
104views more  JOTA 2011»
13 years 4 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