Sciweavers

191 search results - page 7 / 39
» Mappings Between Domain Models in Answer Set Programming
Sort
View
WWW
2009
ACM
15 years 10 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
ICLP
2005
Springer
15 years 3 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ASP
2005
Springer
15 years 3 months ago
Modeling Hybrid Domains Using Process Description Language
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain value...
Sandeep Chintabathina, Michael Gelfond, Richard Wa...
DATE
2003
IEEE
91views Hardware» more  DATE 2003»
15 years 3 months ago
Fast and Accurate Multiprocessor Architecture Exploration with Symbolic Programs
In system-level platform-based embedded systems design, the mapping model is a crucial link between the application model and the architecture model. All three models must match w...
Vladimir D. Zivkovic, Erwin A. de Kock, Pieter van...
BIRTHDAY
2010
Springer
14 years 10 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz