Random logic programs: linear model
From MaRDI portal
Abstract: This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a random program converges to a constant when the number of atoms approaches infinity. Several experimental results are also reported, which justify the suitability of the linear model. It is also experimentally shown that, under this model, the size distribution of answer sets for random programs tends to a normal distribution when the number of atoms is sufficiently large.
Recommendations
Cites work
- Autoepistemic logic
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Computing stable models: worst-case performance estimates
- Continuous models of computation for logic programs: Importing continuous mathematics into logic programming's algorithmic foundations
- Handbook on ontologies
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- Logic Programming
- Nonmonotonic logic. Context-dependent reasoning. Foreword by Ray Reiter
- Probabilistic reasoning with answer sets
- Semantics of (disjunctive) logic programs based on partial evaluation
- Simple Random Logic Programs
- Some (in)translatability results for normal logic programs and propositional theories
- The DLV system for knowledge representation and reasoning
- The Smodels system
- Two-literal logic programs and satisfiability representation of stable models: A comparison
Cited in
(5)
This page was built for publication: Random logic programs: linear model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593016)