Sciweavers

934 search results - page 56 / 187
» Elementary Sets of Logic Programs
Sort
View
102
Voted
EPIA
1997
Springer
15 years 2 months ago
Vivid Agents Arguing about Distributed Extended Logic Programs
Argumentation semantics in extended logic programming has been defined in [5,12] for a single agent which determines its believes by an internal argumentation process. In this pap...
Michael Schroeder, Iara de Almeida Móra, Jo...
AAAI
2008
15 years 14 days ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
118
Voted
ILP
2004
Springer
15 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 2 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
102
Voted
ICLP
1997
Springer
15 years 2 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv