2540 search results - page 281 / 508 » Abstract Logics as Dialgebras |
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
121
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
96
Voted
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
109
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
100
click to vote
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract—Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches h...