3047 search results - page 53 / 610 » On the Meaning of Logical Completeness |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...
LOGCOM
2007
13 years 9 months ago
2007
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
IGPL
2010
13 years 7 months ago
2010
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
DLOG
2011
13 years 1 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
CONCUR
2000
Springer
14 years 1 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...