2911 search results - page 127 / 583 » A Logic of Graph Constraints |
146
Voted
LICS
1995
IEEE
15 years 4 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
100
click to vote
AAAI
2010
15 years 2 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
97
Voted
LATA
2010
Springer
15 years 10 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
CIE
2008
Springer
15 years 23 days ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
163
Voted
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...