Sciweavers

LPNMR
2001
Springer
14 years 3 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
14 years 3 months ago
An Update Front-End for Extended Logic Programs
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
LPNMR
2001
Springer
14 years 3 months ago
NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics
Christian Anger, Kathrin Konczak, Thomas Linke
LPAR
2001
Springer
14 years 3 months ago
Permutation Problems and Channelling Constraints
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
Toby Walsh
LPAR
2001
Springer
14 years 3 months ago
Local Conditional High-Level Robot Programs
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
Sebastian Sardiña
LPAR
2001
Springer
14 years 3 months ago
Efficient Negation Using Abstract Interpretation
Susana Muñoz-Hernández, Juan Jos&eac...
LPAR
2001
Springer
14 years 3 months ago
A Computer Environment for Writing Ordinary Mathematical Proofs
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
David McMath, Marianna Rozenfeld, Richard Sommer
LPAR
2001
Springer
14 years 3 months ago
Functional Logic Programming with Failure: A Set-Oriented View
Francisco Javier López-Fraguas, Jaime S&aac...
LPAR
2001
Springer
14 years 3 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
LPAR
2001
Springer
14 years 3 months ago
Tableaux for Reasoning About Atomic Updates
A simple model of dynamic databases is studied from a modal logic perspecitve. A state α of a database is an atomic update of a state β if at most one atomic statement is evaluat...
Christian G. Fermüller, Georg Moser, Richard ...