4617 search results - page 448 / 924 » Automation of Diagrammatic Reasoning |
165
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
203
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
206
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...
204
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
178
click to vote
ECSQARU
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper addresses the issue of measuring similarity between pieces of uncertain information in the framework of possibility theory. In a first part, natural properties...