Sciweavers

1588 search results - page 44 / 318
» On the Logic of Constitutive Rules
Sort
View
CONCUR
2007
Springer
16 years 9 days ago
Is Observational Congruence Axiomatisable in Equational Horn Logic?
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...
Michael Mendler, Gerald Lüttgen
ICSOC
2004
Springer
15 years 11 months ago
Hybrid web service composition: business processes meet business rules
Over the last few years several process-based web service composition languages have emerged, such as BPEL4WS and BPML. These languages define the composition on the basis of a pr...
Anis Charfi, Mira Mezini
ICFP
2005
ACM
16 years 6 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
ESWS
2009
Springer
16 years 21 days ago
A Rule System for Querying Persistent RDFS Data
We present GiaBATA, a system for storing, aggregating, and querying Semantic Web data, based on declarative logic programming technology, namely on the dlvhex system, which allows ...
Giovambattista Ianni, Thomas Krennwallner, Alessan...
LPAR
2004
Springer
15 years 11 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler