593 search results - page 92 / 119 » RDF and Logic: Reasoning and Extension |
121
Voted
NMELP
1994
15 years 4 months ago
1994
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
108
click to vote
PLILP
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
87
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
98
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
103
click to vote
ASWC
2006
Springer
15 years 4 months ago
2006
Springer
With the increasing use of ontologies in Semantic Web and enterprise knowledge management, it is critical to develop scalable and efficient ontology management systems. In this pap...