Sciweavers

2585 search results - page 81 / 517
» Automating Coherent Logic
Sort
View
CSL
2004
Springer
13 years 9 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
IANDC
2010
119views more  IANDC 2010»
13 years 8 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
KR
2010
Springer
14 years 2 months ago
Interpreting Topological Logics over Euclidean Spaces
Topological logics are a family of languages for representing and reasoning about topological data. In this paper, we consider propositional topological logics able to express the...
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakh...
ICLP
2001
Springer
14 years 2 months ago
A Multi-adjoint Logic Approach to Abductive Reasoning
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
CSL
2004
Springer
14 years 1 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber