Sciweavers

1144 search results - page 122 / 229
» Logic programming for combinatorial problems
Sort
View
LPNMR
2001
Springer
15 years 7 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
IJCAI
1993
15 years 3 months ago
Multiple Predicate Learning
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...
Luc De Raedt, Nada Lavrac, Saso Dzeroski
132
Voted
SIGMOD
2004
ACM
110views Database» more  SIGMOD 2004»
15 years 8 months ago
Liquid Data for WebLogic: Integrating Enterprise Data and Services
Information in today’s enterprises commonly resides in a variety of heterogeneous data sources, including relational databases, web services, files, packaged applications, and c...
Vinayak R. Borkar
ICALP
2009
Springer
15 years 7 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 7 months 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