scientific article

From MaRDI portal
Publication:3750100

zbMath0609.68007MaRDI QIDQ3750100

No author found.

Publication date: 1985


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The complexity of propositional closed world reasoning and circumscriptionSome notes on fusion of uncertain informationComputing the least common subsumer w.r.t. a background terminologyLimited reasoning in first-order knowledge basesReasoning with Forest Logic Programs and f-hybrid knowledge basesModel-preference default theoriesThe complexity of concept languagesEditorial: Towards a science of integrated AI and roboticsUnification theoryDefaults and relevance in model-based reasoningAn epistemic operator for description logicsDefeasible inheritance on cyclic networksMathematical applications of inductive logic programmingUnnamed ItemMaintaining mental models of agents who have existential misconceptionsPrinciples of metareasoningSemantic networksThe preference semantics familySubsumption computed algebraicallyPattern associativity and the retrieval of semantic networksThe descriptive component of a hybrid knowledge representation languageArtificial nonmonotonic neural networksA natural deduction system for discourse representation theoryComputational Aspects of Quasi-Classical EntailmentAttributive concept descriptions with complementsDescription LogicsOntologies and Databases: The DL-Lite ApproachConservation principles and action schemes in the synthesis of geometric conceptsSemantic computations of truth based on associations already learnedTowards Contingent World Descriptions in Description LogicsEXPtime tableaux for ALCTractable reasoning via approximationLogic-based subsumption architecture