A theory of abstraction

DOI10.1016/0004-3702(92)90021-OzbMath0762.68054OpenAlexW2078727257MaRDI QIDQ1199923

Fausto Giunchiglia, Toby Walsh

Publication date: 17 January 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90021-o

zbMATH Keywords

abstract proof checkerabstraction mappingsreasoning with abstraction

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

An approximation framework for solvers and decision procedures, Automatically generating abstractions for planning, Hierarchical fault diagnosis for discrete-event systems under global consistency, Speeding up inferences using relevance reasoning: a formalism and algorithms, On the construction of hierarchic models, Calculating criticalities, Abstracting soft constraints: framework, properties, examples, A taxonomy for similarity metrics between Markov decision processes, First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation, On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras, Automated reformulation of specifications by safe delay of constraints, Towards a practical theory of reformulation for reasoning about physical systems, Proving theorems by reuse, Termination of theorem proving by reuse, ABSFOL: A proof checker with abstraction, Deduction as an Engineering Science, Unnamed Item, From binary temporal relations to non-binary ones and back, Constraint solving for proof planning, Omission-Based Abstraction for Answer Set Programs, Abstraction for non-ground answer set programs, Evaluating ASP and commercial solvers on the CSPLib, A framework for analysing state-abstraction methods, Exploiting functional dependencies in declarative problem specifications, A Proof-Planning Framework with explicit Abstractions based on Indexed Formulas, An application of fuzzy hypergraphs and hypergraphs in granular computing, Conceptual fuzzy sets and their connectives, On terminating lemma speculations., Tractable reasoning via approximation, The inevitability of inconsistent abstract spaces, Hierarchical model-based diagnosis based on structural abstraction

Uses Software

• GETFOL

Cites Work

• Using rewriting rules for connection graphs to prove theorems
• Prolegomena to a theory of mechanized formal reasoning
• Theorem proving with abstraction
• Reasoning about model accuracy
• The inevitability of inconsistent abstract spaces
• Calculating criticalities
• Planning in a hierarchy of abstraction spaces
• Flexible and scalable cost-based query planning in mediators: A transformational approach
• A non-left-to-right, non-directional parser for ambiguous lattices
• A Semantically Guided Deductive System for Automatic Theorem Proving
• Higher Order Logic and Hardware Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item