681 search results - page 49 / 137 » A Logic for True Concurrency |
145
click to vote
ENTCS
2000
15 years 5 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
167
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
174
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
149
click to vote
DLOG
2009
15 years 3 months ago
2009
Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
181
click to vote
SEMWEB
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In the Semantic Web information would be retrieved, processed, combined, shared and reused in the maximum automatic way possible. Obviously, such procedures involve a hig...