Mathematical Programming Embeddings of Logic

Authors:
Vivek S. Borkar;Vijay Chandru;Sanjoy K. Mitter
Affiliations:
Tata Institute of Fundamental Research, Mumbai, India;Indian Institute of Science, Bangalore, India;Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Journal of Automated Reasoning
Year:
2002

Citing 6
Cited 2

Probabilistic logic

Artificial Intelligence
Some results and experiments in programming techniques for propositional logic

Computers and Operations Research - Special issue: Applications of integer programming
Theory of linear and integer programming

Theory of linear and integer programming
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computation-oriented reductions of predicate to propositional logic

Decision Support Systems
Extended Horn sets in propositional logic

Journal of the ACM (JACM)

First-order mixed integer linear programming

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Integer programming

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative, and this approach has yielded rich dividends from the dual perspective of better understanding of the mathematical structure of deduction and in improving the efficiency of algorithms for deductive reasoning. Most of these results have been for the case of propositional and probabilistic logics. In the case of predicate logic, there have been successes in adapting mathematical programming schemes to realize new algorithms for theorem proving using partial instantiation techniques. A structural understanding of mathematical programming embeddings of predicate logic would require tools from topology because of the need to deal with infinite-dimensional embeddings. This paper describes the first steps in this direction. General compactness theorems are proved for the embeddings, and some specialized results are obtained in the case of Horn logic.