Sciweavers

103 search results - page 13 / 21
» A Distributed Argumentation Framework using Defeasible Logic...
Sort
View
118
Voted
PPDP
2007
Springer
15 years 6 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
PSSE
2004
Springer
15 years 5 months ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
109
Voted
CADE
2008
Springer
16 years 23 days ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
98
Voted
SEUS
2005
IEEE
15 years 6 months ago
Development of Distributed Programming Developing Tool-Kit Based on Object Group Model
In this paper, we defined the concept of the grouped distributed objects[10-14], as a logical unit of distributed application service, and developed a distributed programming deve...
Jeong-Taek Lim, Su-Chong Joo, Chang-Sun Shin
ASP
2005
Springer
15 years 6 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre