Sciweavers

4401 search results - page 100 / 881
» Computing with Default Logic
Sort
View
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
14 years 10 days ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
JAPLL
2010
133views more  JAPLL 2010»
13 years 7 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
LICS
1991
IEEE
14 years 10 days ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 8 months ago
Logic Column 15: Coalgebras and Their Logics
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
Alexander Kurz
CONCUR
2010
Springer
13 years 10 months ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu