4192 search results - page 277 / 839 » Probabilistic Logic Programming |
175
click to vote
JACM
2002
15 years 6 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
156
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
142
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
Metallic Carbon Nanotubes (CNTs) create source-drain shorts in Carbon Nanotube Field Effect Transistors (CNFETs), causing excessive leakage, degraded noise margin and delay variat...
169
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
188
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...