Defaults as Generalized Quantifiers

DOI10.1093/logcom/5.4.473zbMath0838.03022OpenAlexW2005447243MaRDI QIDQ4847379

Karl Schlechta

Publication date: 6 June 1996

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/5.4.473

zbMATH Keywords

generalized quantifierdefault logicnonmonotonic reasoningdefaultsautomatic query-answering systemsIBM LILAC projectsufficiently large subsettourist information

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic with extra quantifiers and operators (03C80)

Related Items (14)

Default consequence relations from topology and measure theory ⋮ In All, but Finitely Many, Possible Worlds: Model-Theoretic Investigations on ‘Overwhelming Majority’ Default Conditionals ⋮ Knowledge Means ‘All’, Belief Means ‘Most’ ⋮ In all but finitely many possible worlds: model-theoretic investigations on `\textit{overwhelming majority}' default conditionals ⋮ A Modal Logic of Knowledge, Belief, and Estimation ⋮ Knowledge means ‘all’, belief means ‘most’ ⋮ A modal logic for subjective default reasoning ⋮ SIZE AND LOGIC ⋮ On first-order conditional logics ⋮ Roadmap for preferential logics ⋮ On the Structure of Natural Deduction Derivations for “Generally” ⋮ Sequent Calculi for ‘Generally’ ⋮ New techniques and completeness results for preferential structures ⋮ Probabilistic Modeling of Default Reasoning

This page was built for publication: Defaults as Generalized Quantifiers