Sciweavers

4617 search results - page 361 / 924
» Automation of Diagrammatic Reasoning
Sort
View
ICLP
2001
Springer
15 years 11 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
ICLP
2001
Springer
15 years 11 months ago
PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures
This paper describes the development of the PALS system, an implementation of Prolog that efficiently exploits or-parallelism on share-nothing platforms. PALS makes use of a novel ...
Karen Villaverde, Enrico Pontelli, Hai-Feng Guo, G...
LPAR
2001
Springer
15 years 11 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
LPNMR
2001
Springer
15 years 11 months ago
Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto
Lixto is a system and method for the visual and interactive generation of wrappers for Web pages under the supervision of a human developer, for automatically extracting informatio...
Robert Baumgartner, Sergio Flesca, Georg Gottlob
LPNMR
2001
Springer
15 years 11 months ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...