615 search results - page 105 / 123 » High-Level Nondeterministic Abstractions in |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
WIA
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. We explore the information processing capabilities and efciency of DNA computations by giving two di erent types of implementations of nite-state machines. A ligation-bas...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...