Sciweavers

1836 search results - page 249 / 368
» Hierarchies for semantic classes
Sort
View
IWFM
2003
123views Formal Methods» more  IWFM 2003»
14 years 11 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
JFPLC
2000
14 years 11 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
AAAI
1994
14 years 11 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
GG
2008
Springer
14 years 11 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...
IANDC
2006
81views more  IANDC 2006»
14 years 10 months ago
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
This paper is devoted to probabilistic models for concurrent systems under their true-concurrency semantics. Here we address probabilistic event structures. We consider a new clas...
Samy Abbes, Albert Benveniste