TABLEAUX
1997
Springer
13 years 12 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
TABLEAUX
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
TABLEAUX
1997
Springer
13 years 12 months ago
1997
Springer
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
LFCS
1997
Springer
13 years 12 months ago
1997
Springer
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...
LFCS
1997
Springer
13 years 12 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
LFCS
1997
Springer
13 years 12 months ago
1997
Springer
LFCS
1997
Springer
13 years 12 months ago
1997
Springer
KI
1997
Springer
13 years 12 months ago
1997
Springer
KI
1997
Springer
13 years 12 months ago
1997
Springer
KI
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Agents situated in proactive environments are acting autonomously while the environment is evolving alongside, whether or not the agents carry out any particular actions....