Sciweavers

263 search results - page 28 / 53
» From Declarative Languages to Declarative Processing in Comp...
Sort
View
SCP
1998
163views more  SCP 1998»
13 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 8 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
ICLP
2003
Springer
14 years 17 days ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
ICCL
1994
IEEE
13 years 11 months ago
A Compositional Approach to Concurrent Object-Oriented Programming
This paper presents a model of concurrent objectoriented programming in which specification of computational behavior is separated from specification of interaction behavior of me...
Raju Pandey, James C. Browne
AI
2005
Springer
13 years 7 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf