14 search results - page 1 / 3 » Propositional logic of continuous transformations in Cantor ... |
65
Voted
AML
2005
14 years 10 months ago
2005
81
Voted
AML
2006
14 years 11 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
102
Voted
AML
2010
14 years 11 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
96
Voted
JELIA
2004
Springer
15 years 4 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
113
click to vote
JAR
2006
14 years 10 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...