Sciweavers

4008 search results - page 423 / 802
» An expressive language of signatures
Sort
View
ICALP
1998
Springer
15 years 11 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
177
Voted
ICLP
1997
Springer
15 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
205
Voted
RULES
1993
Springer
159views Database» more  RULES 1993»
15 years 11 months ago
Implementing Relationships and Constraints in an Object-Oriented Database Using a Monitor Construct
Semantic models have shown the utility of arbitrary user-de ned relationships for de ning the semantics of database information, while objectoriented models have developed a stron...
Michael Doherty, Joan Peckham, Victor Fay Wolfe
171
Voted
FOAL
2007
ACM
15 years 10 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
AI
2001
Springer
15 years 10 months ago
Stratified Partial-Order Logic Programming
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
Mauricio Osorio, Juan Carlos Nieves