Sciweavers

4617 search results - page 840 / 924
» Automation of Diagrammatic Reasoning
Sort
View
ICLP
2005
Springer
16 years 9 days ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
ICLP
2005
Springer
16 years 9 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
ICLP
2005
Springer
16 years 9 days ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
ICLP
2005
Springer
16 years 9 days ago
An Optimised Semantic Web Query Language Implementation in Prolog
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...
Jan Wielemaker
ICN
2005
Springer
16 years 9 days ago
On the Security of Cluster-Based Communication Protocols for Wireless Sensor Networks
Wireless sensor networks are ad hoc networks comprised mainly of small sensor nodes with limited resources, and are rapidly emerging as a technology for large-scale, lowcost, autom...
Adrian Carlos Ferreira, Marcos Aurélio Vila...