Sciweavers

4192 search results - page 508 / 839
» Probabilistic Logic Programming
Sort
View
EACL
2003
ACL Anthology
15 years 5 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 4 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
ENTCS
2008
105views more  ENTCS 2008»
15 years 4 months ago
Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
Bernd Braßel, Sebastian Fischer, Frank Huch
ECRA
2002
129views more  ECRA 2002»
15 years 4 months ago
A formal approach to negotiating agents development
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communi...
Marlon Dumas, Guido Governatori, Arthur H. M. ter ...
ASPLOS
2011
ACM
14 years 8 months ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen