Sciweavers

1020 search results - page 32 / 204
» Tight Semantics for Logic Programs
Sort
View
AGP
1997
IEEE
14 years 1 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
LPNMR
2004
Springer
14 years 2 months ago
Simplifying Logic Programs Under Uniform and Strong Equivalence
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
FLAIRS
2007
13 years 11 months ago
Prioritized Reasoning in Logic Programming
This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of th...
Luciano Caroprese, Irina Trubitsyna, Ester Zumpano
LPNMR
1993
Springer
14 years 26 days 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...
COLING
2000
13 years 10 months ago
Learning Semantic-Level Information Extraction Rules by Type-Oriented ILP
This paper describes an approach to using semantic rcprcsentations for learning information extraction (IE) rules by a type-oriented inductire logic programming (ILl)) system. NLP...
Yutaka Sasaki, Yoshihiro Matsuo