Sciweavers

ENTCS
2008
102views more  ENTCS 2008»
13 years 4 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda
AAAI
2006
13 years 5 months ago
MPE and Partial Inversion in Lifted Probabilistic Variable Elimination
It is often convenient to represent probabilistic models in a first-order fashion, using logical atoms such as
Rodrigo de Salvo Braz, Eyal Amir, Dan Roth
PPDP
1999
Springer
13 years 8 months ago
Distributed Programming in a Multi-Paradigm Declarative Language
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
Michael Hanus
WISE
2002
Springer
13 years 9 months ago
Towards Declarative XML Querying
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
Mengchi Liu, Tok Wang Ling
EPIA
2003
Springer
13 years 9 months ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
PADL
2004
Springer
13 years 9 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
CP
2007
Springer
13 years 10 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli