New methods for computing inferences in first order logic (Q1309900)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	New methods for computing inferences in first order logic	scientific article

Statements

scholarly article

New methods for computing inferences in first order logic (English)

Annals of Operations Research

publication date

20 December 1993

zbMATH Keywords

satisfiability algorithms

partial instantiation

decidable fragment of first order logic

MaRDI profile type

MaRDI publication profile

Some results and experiments in programming techniques for propositional logic

Extended Horn sets in propositional logic

A note on the Entscheidungsproblem

Algorithms for testing the satisfiability of propositional formulae

Probabilistic satisfiability

Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory

Resolution vs. cutting plane solution of inference problems: Some computational experience

Input Proofs and Rank One Cutting Planes

Solving the incremental satisfiability problem

Branch-and-cut solution of inference problems in propositional logic

Solving propositional satisfiability problems

Computational experience with an interior point algorithm on the satisfiability problem

A linear programming approach to reasoning about probabilities

Probabilistic logic

Identifiers

zbMATH Open document ID

10.1007/BF02027814

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:1309900

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1309900&oldid=34114629"