2540 search results - page 245 / 508 » Abstract Logics as Dialgebras |
217
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
191
Voted
FUIN
2007
15 years 6 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
187
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
158
click to vote
COMMA
2006
15 years 8 months ago
2006
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
169
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...