Quantitative deduction and its fixpoint theory

DOI10.1016/0743-1066(86)90003-8zbMath0609.68068OpenAlexW2129802691MaRDI QIDQ3750144

Maarten H. Van Emden

Publication date: 1986

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(86)90003-8

zbMATH Keywords

Herbrand modelsfuzzy setPROLOGexpert systemslogic programmingproof treetwo-person gamesalpha-beta pruningNimfuzzy deductionquantitative deduction

Mathematics Subject Classification ID

2-person games (91A05) Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)

Related Items

XSB: Extending Prolog with Tabled Logic Programming ⋮ Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ Beyond multi-adjoint logic programming ⋮ A new approach to hybrid probabilistic logic programs ⋮ Game semantics for non-monotonic intensional logic programming ⋮ A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency ⋮ Thresholded semantic framework for a fully integrated fuzzy logic language ⋮ A game semantics for disjunctive logic programming ⋮ Immediate consequences operator on generalized quantifiers ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds ⋮ Proof and refutation in MALL as a game ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Semantic probabilistic inference of predictions ⋮ A core language for fuzzy answer set programming ⋮ Focused most probable world computations in probabilistic logic programs ⋮ Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness ⋮ Fuzzy logic programming ⋮ Exploiting Game Theory for Analysing Justifications ⋮ A TUPLE-ORIENTED ALGORITHM FOR DEDUCTION IN A FUZZY RELATIONAL DATABASE ⋮ Multi-valued logic programming semantics An algebraic approach ⋮ Answering queries from context-sensitive probabilistic knowledge bases ⋮ Using Histograms to Better Answer Queries to Probabilistic Logic Programs ⋮ A Transformation-based implementation for CLP with qualification and proximity ⋮ An infinite-game semantics for well-founded negation in logic programming ⋮ A logic for reasoning with inconsistency ⋮ Proximity-based unification theory ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Probabilistic logic programming ⋮ A declarative semantics for CLP with qualification and proximity ⋮ An encompassing framework for paraconsistent logic programs ⋮ Quantitative Logic Programming Revisited ⋮ Qualified Logic Programming with Bivalued Predicates ⋮ Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty ⋮ Paraconsistent logic programming ⋮ Programming in three-valued logic ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Unnamed Item ⋮ Aggregated fuzzy answer set programming ⋮ Annotated fuzzy logic programs ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Towards Ludics Programming: Interactive Proof Search ⋮ Learning any memory-less discrete semantics for dynamical systems represented by logic programs ⋮ A semantical framework for supporting subjective and conditional probabilities in deductive databases ⋮ Probabilistic Horn abduction and Bayesian networks ⋮ Annotated revision programs ⋮ Fixpoint semantics for logic programming a survey ⋮ Approximate reasoning by similarity-based SLD resolution.