scientific article

Michael R. Genesereth, Nils J. Nilsson

Publication date: 1987

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

artificial intelligence reasoning nonmonotonic reasoning exercises first-order predicate-calculus resolution-refutation

Artificial intelligence (68T99) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

A resolution principle for constrained logics, Tutorial on ontological engineering. I: Introduction to ontological engineering, Properties of SLUR Formulae, Problem solving by searching for models with a theorem prover, Towards efficient induction mechanisms in database systems, Indentification of inductive properties during verification of synchronous sequential circuits, A formal semantics for DAI language NUML, Mechanical verification on strategies, Resolution and the integrality of satisfiability problems, Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models, A numerical strategy to defectuous knowledge using, Static and dynamic aspects of goal-oriented concurrency control, Generalized resolution for 0--1 linear inequalities, Belief revision in a microworld, Branch-and-cut solution of inference problems in propositional logic, A logical framework for default reasoning, An experiment in the application of similarity-based learning to programming by example, Proof systems and transformation games, A generalization of collapsible cases of circumscription, Filter-based resolution principle for lattice-valued propositional logic LP\((X)\), The HeKatE methodology. Hybrid engineering of intelligent systems, European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988, MIDEALS AND NONMONOTONIC LOGIC, PALO: a probabilistic hill-climbing algorithm, Probabilities, possibilities, and fuzzy sets, On Skolemization in constrained logics, Talking to Sibilla: An approach to context dependent natural language comprehension, Speeding up inferences using relevance reasoning: a formalism and algorithms, ECWA made easy, A decomposition method for CNF minimality proofs, Logical settings for concept-learning, Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design, THE LANDSCAPE OF INCONSISTENCY: A PERSPECTIVE, PARACONSISTENT INFERENCE FROM DATA USING EXISTENTIAL Ω-ENTAILMENT, Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I, Inductive constraint logic, An algebraic structured model of formal knowledge representations (frames and rules), Permissive planning: Extending classical planning to uncertain task domains., Boolean functions with a simple certificate for CNF complexity, Postulates for revising BDI structures, Toward logical analysis of tabular rule-based systems, The inverse satisfiability problem, Information-based distance measures and the canonical reflection of view updates, Abnormality and randomness, Relations between threshold and \(k\)-interval Boolean functions, The \(Multi\)-SAT algorithm, Boolean functions with long prime implicants, Frames in the space of situations, Partition-based logical reasoning for first-order and propositional theories, Finding optimal derivation strategies in redundant knowledge bases, Logics of public communications, Reasoning about reasoning in a meta-level architecture, Maintaining mental models of agents who have existential misconceptions, Approximate reasoning with credible subsets, Induction in linear logic, A lightweight epistemic logic and its application to planning, Hydras: complexity on general graphs and a subclass of trees, Bayesian diagnosis in expert systems, Truth maintenance systems and their application for verifying expert system knowledge bases, The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself, Unnamed Item, Semantic networks, A subclass of Horn CNFs optimally compressible in polynomial time, Exclusive and essential sets of implicates of Boolean functions, Mathematical knowledge representation: semantic models and formalisms, Markov logic networks, Fuzzy logic -- a personal perspective, Automated merging of conflicting knowledge bases, using a consistent, majority-rule approach with knowledge-form maintenance, A clausal resolution method for CTL branching-time temporal logic, An infrastructure to support cooperation of knowledge-level agents on the semantic grid, Information-Optimal Reflections of View Updates on Relational Database Schemata, Regression planning, Computing finite models by reduction to function-free clause logic, A resolution-based system for symbolic approximate reasoning, Compiling a default reasoning system into Prolog, Logical foundations of knowledge-based recommender systems: a unifying spectrum of alternatives, A compositional approach to probabilistic knowledge compilation, Logic of agreement: Foundations, semantic system and proof theory, A model of three-way decisions for knowledge harnessing, Multiple perspective dynamic decision making, From environments to representations -- a mathematical theory of artificial perceptions, Recognition of interval Boolean functions, Disjoint essential sets of implicates of a CQ Horn function, Estimating the probability of meeting a deadline in schedules and plans, Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context, Minimal and consistent evolution of knowledge bases, On the complexity of data disjunctions., On the Hamming distance of constraint satisfaction problems., New methods for computing inferences in first order logic, User modeling for flexible inference control and its relevance to decision-making in economics and management, Axiomatization and completeness of uncountably valued approximation logic, Explaining by evidence