191 search results - page 25 / 39 » Mappings Between Domain Models in Answer Set Programming |
PROFES
2001
Springer
15 years 2 months ago
2001
Springer
New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a give...
TACAS
2005
Springer
15 years 3 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
101
click to vote
AAAI
2007
15 years 7 hour ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
FCCM
2000
IEEE
15 years 2 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...