Sciweavers

1151 search results - page 98 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
100
Voted
KR
2000
Springer
15 years 7 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
128
Voted
JAPLL
2010
141views more  JAPLL 2010»
15 years 2 months ago
Algebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
Jocelyne Faddoul, Volker Haarslev
136
Voted
ESWS
2007
Springer
15 years 9 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
POPL
2005
ACM
16 years 3 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
163
Voted
DLOG
2011
14 years 7 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...