Prolog technology for default reasoning: proof theory and compilation techniques
type: Item
instance of: scholarly article
title: Prolog technology for default reasoning: proof theory and compilation techniques
zbMATH Open document ID: 0909.68161
DOI: 10.1016/S0004-3702(98)00092-7
author: Torsten Schaub
author: Stefan Brüning
published in: Artificial Intelligence
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 1238960
zbMATH Keywords: default reasoning
zbMATH Keywords: automated reasoning
zbMATH Keywords: default logic
zbMATH Keywords: model elimination
zbMATH Keywords: PTTP
zbMATH Keywords: model-based consistency checking
describes a project that uses: SETHEO
describes a project that uses: SCOTT
describes a project that uses: GraphBase
describes a project that uses: Datalog
describes a project that uses: PROTEIN
describes a project that uses: KoMeT
MaRDI profile type: Publication
cites work: A proof theoretical approach to default reasoning I: tableaux for default logic
cites work: Q3490987
cites work: Model elimination without contrapositives
cites work: Q4132480
cites work: Q4837944
cites work: KoMeT
cites work: Q4692618
cites work: A sequent calculus for skeptical Default Logic
cites work: Sequent calculi for default and autoepistemic logics
cites work: Q4202917
cites work: Cumulative default logic: In defense of nonmonotonic inference rules
cites work: Q5679729
cites work: Q4474859
cites work: Q3919057
cites work: A Computing Procedure for Quantification Theory
cites work: Alternative approaches to default logic
cites work: Q3997615
cites work: Q4052071
cites work: Q4296748
cites work: Q4028795
cites work: A circumscriptive theorem prover
cites work: On cumulative default logics
cites work: Complexity Results for Nonmonotonic Logics
cites work: Q3140399
cites work: SETHEO: A high-performance theorem prover
cites work: Controlled integration of the cut rule into connection tableau calculi
cites work: Towards a classification of defaults logics
cites work: Q4139711
cites work: Mechanical Theorem-Proving by Model Elimination
cites work: Q4273952
cites work: Q4202924
cites work: Q3807179
cites work: A decision method for nonmonotonic reasoning based on autoepistemic reasoning
cites work: Q4692794
cites work: Basis property in \(L_{p}(0, 1)\) of the system of eigenfunctions corresponding to a problem with a spectral parameter in the boundary condition
cites work: A logical framework for default reasoning
cites work: Q3493282
cites work: Compiling a default reasoning system into Prolog
cites work: An algorithm to compute circumscription
cites work: A logic for default reasoning
cites work: Analytic tableaux for default logics
cites work: XRay: A prolog technology theorem prover for default reasoning: A system description
cites work: A new methodology for query answering in default logics via structure-oriented theorem proving
cites work: Q4236375
cites work: Tableau-based characterization and theorem proving for default logic
cites work: Refutation graphs
cites work: A Prolog technology theorem prover: A new exposition and implementation in Prolog
cites work: Default reasoning by deductive planning
cites work: A tableaux-based theorem prover for a decidable subset of default logic
full work available at URL: s0004-3702(98)00092-7
OpenAlex ID: W4248795502
description: scientific article; zbMATH DE number 1238960