Sciweavers

1963 search results - page 49 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 9 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
IEEEPACT
2000
IEEE
15 years 10 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
LPNMR
2001
Springer
15 years 10 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ä
USENIX
1993
15 years 7 months ago
Wafe - An X Toolkit Based Frontend for Application Programs in Various Programming Languages
Wafe provides a flexible and easy to use interface to the X Toolkit (Xt) and the Athena widget set (Xaw) using the embeddable command language Tcl [1]. It allows access to Xt’s...
Gustaf Neumann, Stefan Nusser
LOGCOM
2007
97views more  LOGCOM 2007»
15 years 5 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits