Sciweavers

1020 search results - page 74 / 204
» Tight Semantics for Logic Programs
Sort
View
CADE
1992
Springer
14 years 1 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
KR
2004
Springer
14 years 2 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
FUIN
2010
130views more  FUIN 2010»
13 years 7 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
SEMWEB
2010
Springer
13 years 6 months ago
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA...
Jan Dedek
LPKR
1997
Springer
14 years 1 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix