Sciweavers

ICLP
2010
Springer
13 years 8 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
APLAS
2007
ACM
13 years 8 months ago
On a Tighter Integration of Functional and Logic Programming
The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: ...
Bernd Braßel, Frank Huch
ICML
1989
IEEE
13 years 8 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 8 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ICLP
1992
Springer
13 years 8 months ago
A Declarative View of Inheritance in Logic Programming
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
Michele Bugliesi
POPL
1994
ACM
13 years 8 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
PPCP
1993
13 years 8 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
KR
1994
Springer
13 years 8 months ago
REVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...
Carlos Viegas Damásio, Wolfgang Nejdl, Lu&i...
LPNMR
1993
Springer
13 years 8 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
CADE
1992
Springer
13 years 8 months ago
Implementing the Meta-Theory of Deductive Systems
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
Frank Pfenning, Ekkehard Rohwedder