Results 1  10
of
867
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (48 self)
 Add to MetaCart
. Isabelle is now based on higherorder logic  a precise and wellunderstood foundation. Examples illustrate use of this metalogic to formalize logics and proofs. Axioms for firstorder logic are shown sound and complete. Backwards proof is formalized by metareasoning about objectlevel entailment
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
in a more gen eral setting? We compare the marginals com puted using loopy propagation to the exact ones in four Bayesian network architectures, including two realworld networks: ALARM and QMR. We find that the loopy beliefs of ten converge and when they do, they give a good approximation
Combining Proofs of HigherOrder and FirstOrder Automated Theorem Provers
"... Ωants is an agentoriented environment for combining inference systems. A characteristics of the Ωants approach is that a common proof object is generated by the cooperating systems. This common proof object can be inspected by verification tools to validate the correctness of the proof. Ωants mak ..."
Abstract
 Add to MetaCart
makes use of a two layered blackboard architecture, in which the applicability of inference rules are checked on one (abstract) layer. The lower layer administrates explicit proof objects in a common language. In concrete proofs these proof objects can be quite bit, which can make communication during
Firstorder Logic theorem prover.
"... Abstract. A major merit of the Web Service Modeling Ontology WSMO is the wellstructured and unambiguous definition of the description elements for its components. This allows developing concise, generic inference mechanisms for basic Semantic Web Service technologies like Web Service Discovery as th ..."
Abstract
 Add to MetaCart
Abstract. A major merit of the Web Service Modeling Ontology WSMO is the wellstructured and unambiguous definition of the description elements for its components. This allows developing concise, generic inference mechanisms for basic Semantic Web Service technologies like Web Service Discovery as the detection of suitable Wed Services for solving a Goal. This paper introduces WOOGLE, a basic but powerful and generic WSMOenabled Web Service discovery mechanism that is developed in the course of the Semantic Web Fred project. We outline the underlying conceptual model for Web Service Discovery in WSMO, discuss the WOOGLE functionality in the context of Semantic Web Fred, and explain its realization on top of a
Firstorder proof tactics in higherorder logic theorem provers
 Design and Application of Strategies/Tactics in Higher Order Logics, number NASA/CP2003212448 in NASA Technical Reports
, 2003
"... Abstract. In this paper we evaluate the effectiveness of firstorder proof procedures when used as tactics for proving subgoals in a higherorder logic interactive theorem prover. We first motivate why such firstorder proof tactics are useful, and then describe the core integrating technology: an ‘ ..."
Abstract

Cited by 71 (4 self)
 Add to MetaCart
Abstract. In this paper we evaluate the effectiveness of firstorder proof procedures when used as tactics for proving subgoals in a higherorder logic interactive theorem prover. We first motivate why such firstorder proof tactics are useful, and then describe the core integrating technology
An InstantiationBased Theorem Prover for FirstOrder Programming
"... Firstorder programming (FOP) is a new representation language that combines the strengths of mixedinteger linear programming (MILP) and firstorder logic (FOL). In this paper we describe a novel feasibility proving system for FOP formulas that combines MILP solving with instancebased methods from ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Firstorder programming (FOP) is a new representation language that combines the strengths of mixedinteger linear programming (MILP) and firstorder logic (FOL). In this paper we describe a novel feasibility proving system for FOP formulas that combines MILP solving with instancebased methods
An InstantiationBased Theorem Prover for FirstOrder Programming
"... Firstorder programming (FOP) is a new representation language that combines the strengths of mixedinteger linear programming (MILP) and firstorder logic (FOL). In this paper we describe a novel feasibility proving system for FOP formulas that combines MILP solving with instancebased methods fr ..."
Abstract
 Add to MetaCart
Firstorder programming (FOP) is a new representation language that combines the strengths of mixedinteger linear programming (MILP) and firstorder logic (FOL). In this paper we describe a novel feasibility proving system for FOP formulas that combines MILP solving with instancebased methods
A Guide to LP, The Larch Prover
, 1991
"... This guide provides an introduction to LP (the Larch Prover), Release 2.2. It describes how LP can be used to axiomatize theories in a subset of multisorted firstorder logic and to provide assistance in proving theorems. It also contains a tutorial overview of the equational termrewriting technolo ..."
Abstract

Cited by 140 (6 self)
 Add to MetaCart
This guide provides an introduction to LP (the Larch Prover), Release 2.2. It describes how LP can be used to axiomatize theories in a subset of multisorted firstorder logic and to provide assistance in proving theorems. It also contains a tutorial overview of the equational term
Can a higherorder and a firstorder theorem prover cooperate?
 IN FRANZ BAADER AND ANDREI VORONKOV, EDITORS, LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING — 11TH INTERNATIONAL WORKSHOP, LPAR 2004, LNAI 3452
, 2005
"... Stateoftheart firstorder automated theorem proving systems have reached considerable strength over recent years. However, in many areas of mathematics they are still a long way from reliably proving theorems that would be considered relatively simple by humans. For example, when reasoning about ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
of clauses prevent these systems from solving a whole range of problems. We present a solution to this challenge by combining a higherorder and a firstorder automated theorem prover, both based on the resolution principle, in a flexible and distributed environment. By this we can exploit concise problem
Results 1  10
of
867