Sciweavers

1743 search results - page 168 / 349
» Generalized Modal Satisfiability
Sort
View
127
Voted
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 3 months ago
Loop Formulas for Description Logic Programs
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Sh...
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 3 months ago
Significant Diagnostic Counterexamples in Probabilistic Model Checking
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
Miguel E. Andrés, Pedro R. D'Argenio, Peter...
100
Voted
CORR
2010
Springer
68views Education» more  CORR 2010»
15 years 3 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 3 months ago
Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff
We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme...
Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Mü...
DCG
2010
132views more  DCG 2010»
15 years 3 months ago
Delaunay Refinement for Piecewise Smooth Complexes
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos