Results 1  10
of
1,127,119
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 (49 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
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
MGTP: a model generation theorem proverits advanced features and applications
 ACM Transactions on Design Automation of Electronic Systems
, 1997
"... We survey recent developments in high level synthesis technology for VLSI design. The need for higherlevel design automation tools are discussed first. We then describe some basic techniques for various subtasks of highlevel synthesis. Techniques that have been proposed in the past few years (sinc ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We survey recent developments in high level synthesis technology for VLSI design. The need for higherlevel design automation tools are discussed first. We then describe some basic techniques for various subtasks of highlevel synthesis. Techniques that have been proposed in the past few years
The Semantics of Predicate Logic as a Programming Language
 Journal of the ACM
, 1976
"... ABSTRACT Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpomt semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational ..."
Abstract

Cited by 810 (18 self)
 Add to MetaCart
ABSTRACT Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpomt semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
An Analysis of FirstOrder Logics of Probability
 Artificial Intelligence
, 1990
"... : We consider two approaches to giving semantics to firstorder logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies is greater ..."
Abstract

Cited by 316 (18 self)
 Add to MetaCart
: We consider two approaches to giving semantics to firstorder logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
A Spatial Logic based on Regions and Connection
 PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING
, 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract

Cited by 736 (32 self)
 Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its
A firstorder primaldual algorithm for convex problems with applications to imaging
, 2010
"... In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering in this paper ..."
Abstract

Cited by 435 (20 self)
 Add to MetaCart
In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering
Results 1  10
of
1,127,119