Sciweavers

1087 search results - page 113 / 218
» Exploiting Description Logic Reasoners in Inductive Logic
Sort
View
LICS
1999
IEEE
15 years 2 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
WISE
2005
Springer
15 years 3 months ago
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
Pakornpong Pothipruk, Guido Governatori
ICFP
2005
ACM
15 years 10 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
JWSR
2007
89views more  JWSR 2007»
14 years 9 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
IJCAI
1989
14 years 11 months ago
Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
Erik Sandewall