345 search results - page 23 / 69 » Kripke models for classical logic |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
LANMR
2007
13 years 9 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
JAIR
2012
11 years 10 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
ENTCS
2006
13 years 7 months ago
2006
The -calculus is destructive: its main computational mechanism