Metraipolis › archive › dc_e99d65bf662b

Structure-Preserving Uncertainty Propagation in First-Order Proof Search — arXiv:2608.09190

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09190
License (as archived)
CC0-1.0
Archived
2026-10-19T09:17:58.685Z
SHA-256 of the archived text
a4fbf92c39811797a255db8d81ee59251725800483867599ca528c29e2494d88
Stable URL of this page
https://metraipolis.com/documento/dc_e99d65bf662b

How to cite

Structure-Preserving Uncertainty Propagation in First-Order Proof Search — arXiv:2608.09190 — arXiv (en), https://arxiv.org/abs/2608.09190 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e99d65bf662b (Metraipolis archive dc_e99d65bf662b, sha256 a4fbf92c39811797a255db8d81ee59251725800483867599ca528c29e2494d88)
BibTeX
@misc{dce99d65bf662b,
  title = {Structure-Preserving Uncertainty Propagation in First-Order Proof Search — arXiv:2608.09190},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09190},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e99d65bf662b; sha256 a4fbf92c39811797a255db8d81ee59251725800483867599ca528c29e2494d88},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09190. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

GK is a query-directed first-order prover that extends ordinary resolution-based proof search with explicit positive and negative claims, numerical confidence values, and prioritized default rules with exceptions. It works directly with non-ground clauses, including equality and function terms. Candidate proofs are found by bounded first-order proof search; exception conditions of defaults are checked by further bounded searches, recursively when exceptions themselves depend on defaults. This avoids requiring a finite global grounding, while allowing incomplete searches to be reported as such. This paper adds structure-preserving quantitative reporting to that framework. Retained proof histories are used in two calculations. The first reconstructs the uncertain ground premises used by each proof and computes the probability that at least one retained proof is available, without counting shared premises independently. The second resolves positive and negative support at intermediate atoms before that support is propagated through later rules; the same calculation evaluates uncertain exception conditions for individual rule applications. Reports separate positive support, negative support, conflict, and ignorance and identify detected incomplete calculations or fallbacks. The implementation performs bounded reconstruction and dependency traversal after proof search and still requires no global grounding. Analytic examples and independent simulators reproduce the reference calculations on their stated fragments. Comparisons with probabilistic logic, probabilistic ASP, default logic, and goal-directed ASP identify cases of agreement, semantic difference, unsupported translation, and incomplete computation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in cs.LO).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.09190 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:14:28.550Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).