Sciweavers

557 search results - page 29 / 112
» Useful Transformations in Answer set programming
Sort
View
ESWS
2010
Springer
15 years 3 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
IDEAS
2005
IEEE
93views Database» more  IDEAS 2005»
15 years 7 months ago
Semantic Query Transformation Using Ontologies
Traditional approaches to query processing aim at rewriting a given query into another more efficient one that uses less time and/or resources during the execution. There by, the...
Chokri Ben Necib, Johann Christoph Freytag
POPL
2003
ACM
15 years 7 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke
POPL
2006
ACM
16 years 2 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
235
Voted
LPNMR
2011
Springer
14 years 4 months ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...