Sciweavers

342 search results - page 51 / 69
» Coalgebraic Symbolic Semantics
Sort
View
FOSSACS
2004
Springer
14 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
TSD
2004
Springer
14 years 3 months ago
Building a Dependency-Based Grammar for Parsing Informal Mathematical Discourse
Discourse in formal domains, such as mathematics, is characterized by a mixture of telegraphic natural language and embedded formal expressions. Little is known about the suitabil...
Magdalena Wolska, Ivana Kruijff-Korbayová
DEXAW
2003
IEEE
113views Database» more  DEXAW 2003»
14 years 3 months ago
Integrating Ontology Languages and Answer Set Programming
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
Stijn Heymans, Dirk Vermeir
RTSS
1999
IEEE
14 years 2 months ago
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinks...
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
14 years 1 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider