135 search results - page 11 / 27 » Constructive Logic with Strong Negation as a Substructural L... |
PEPM
2007
ACM
14 years 26 days ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
DIMACS
1996
13 years 8 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
JSYML
2006
13 years 6 months ago
2006
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
LFCS
2009
Springer
14 years 1 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...