Sciweavers

1312 search results - page 231 / 263
» Quantitative Comparison of Languages
Sort
View
CCIA
2005
Springer
14 years 3 months ago
On Warranted Inference in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
Carlos Iván Chesñevar, Guillermo Ric...
ECSQARU
2005
Springer
14 years 3 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
FASE
2005
Springer
14 years 3 months ago
Iterative Circular Coinduction for CoCasl in Isabelle/HOL
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
ICAPR
2005
Springer
14 years 3 months ago
Applying Software Analysis Technology to Lightweight Semantic Markup of Document Text
Abstract. Software analysis techniques, and in particular software “design recovery”, have been highly successful at both technical and businesslevel semantic markup of large s...
Nadzeya Kiyavitskaya, Nicola Zeni, James R. Cordy,...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 3 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....