Sciweavers

6167 search results - page 23 / 1234
» Can Refinement be Automated
Sort
View
KR
2000
Springer
14 years 1 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
CSL
2006
Springer
13 years 10 months ago
Adaptation of maximum entropy capitalizer: Little data can help a lot
A novel technique for maximum "a posteriori" (MAP) adaptation of maximum entropy (MaxEnt) and maximum entropy Markov models (MEMM) is presented. The technique is applied...
Ciprian Chelba, Alex Acero
LPAR
2005
Springer
14 years 3 months ago
Recursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
DAC
2006
ACM
14 years 10 months ago
Guiding simulation with increasingly refined abstract traces
Traces Kuntal Nanshi, Fabio Somenzi University of Colorado at Boulder ne abstraction refinement and simulation to provide a more efficient approach to checking invariant properti...
Kuntal Nanshi, Fabio Somenzi
DSOM
2006
Springer
14 years 1 months ago
Ontology-Based Policy Refinement Using SWRL Rules for Management Information Definitions in OWL
Abstract. The goal of ontology-based management is to improve the manageability of network resources through the application of formal ontologies. Prior research work has studied t...
Antonio Guerrero, Víctor A. Villagrá...