Sciweavers

2035 search results - page 172 / 407
» On the complexity of stratified logics
Sort
View
ESWS
2010
Springer
15 years 8 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter
WSC
1997
15 years 7 months ago
AutoMod Tutorial
The AutoModTM simulation system differs significantly from other systems because of its ability to deal with the physical elements of a system in physical (graphical) terms and th...
Matthew W. Rohrer
RR
2010
Springer
15 years 4 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
DLOG
2009
15 years 4 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
CADE
2004
Springer
16 years 6 months ago
Experiments on Supporting Interactive Proof Using Resolution
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
Jia Meng, Lawrence C. Paulson