Sciweavers

681 search results - page 73 / 137
» A Logic for True Concurrency
Sort
View
ECAI
1998
Springer
15 years 3 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
KR
1991
Springer
15 years 3 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
TCS
2008
14 years 11 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
JDM
2000
82views more  JDM 2000»
14 years 11 months ago
Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach
Little work has been completed which addresses the logical composition and use of ternary relationships in entity-relationship modeling. Many modeling notations and most CASE tool...
Trevor H. Jones, Il-Yeol Song
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
15 years 5 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym