Random logic programs: linear model
From MaRDI portal
Publication:4593016
DOI10.1017/S1471068414000611zbMATH Open1379.68085arXiv1406.6102MaRDI QIDQ4593016FDOQ4593016
Authors: Kewen Wang, Lian Wen, Kedian Mu
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1406.6102
Recommendations
Cites Work
- Title not available (Why is that?)
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- The DLV system for knowledge representation and reasoning
- Autoepistemic logic
- Title not available (Why is that?)
- Probabilistic reasoning with answer sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook on ontologies
- Title not available (Why is that?)
- Semantics of (disjunctive) logic programs based on partial evaluation
- Logic Programming
- Some (in)translatability results for normal logic programs and propositional theories
- Title not available (Why is that?)
- Simple Random Logic Programs
- Computing stable models: worst-case performance estimates
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)