Sciweavers

580 search results - page 49 / 116
» On the Foundations of Answer Set Programming
Sort
View
LPNMR
2009
Springer
14 years 3 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
DALT
2009
Springer
14 years 3 months ago
Playing with Rules
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
João Leite
RULEML
2004
Springer
14 years 2 months ago
Semantic Web Reasoning with Conceptual Logic Programs
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
SLP
1994
89views more  SLP 1994»
13 years 10 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
AGP
2003
IEEE
14 years 2 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer