Results 1  10
of
237,565
Resolution on Quantified Generalized Clausesets
, 2009
"... This paper is devoted to investigate resolution for quantified generalized clausesets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Horn clausesets are introduced for which a restricted resolution, called quantified positive unit resolution, is proved to ..."
Abstract
 Add to MetaCart
This paper is devoted to investigate resolution for quantified generalized clausesets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Horn clausesets are introduced for which a restricted resolution, called quantified positive unit resolution, is proved
A General Clause Theorem Prover
 In Stickel M.E. (Ed.), Proceedings of the 10th International Conference on Automated Deduction
, 1990
"... geoff%wacsvax.uwa.oz.au ..."
A Model Elimination Calculus for Generalized Clauses
 In IJCAI
, 1991
"... Generalized clauses differ from (ordinary) clauses by allowing conjunctions of literals in the role of (ordinary) literals, i.e. they are dis junctions of conjunctions of simple literals. An advantage of this clausal form is that implica tions with conjunctive conclusions or disjunc tive premises ar ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Generalized clauses differ from (ordinary) clauses by allowing conjunctions of literals in the role of (ordinary) literals, i.e. they are dis junctions of conjunctions of simple literals. An advantage of this clausal form is that implica tions with conjunctive conclusions or disjunc tive premises
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 509 (2 self)
 Add to MetaCart
theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of hornclause logic programs. We show how to perform derivations in this logic using a
An Overview of the C++ Programming Language
, 1999
"... This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction, ..."
Abstract

Cited by 1766 (15 self)
 Add to MetaCart
This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
approaches such as the DavisPutnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, Nqueens, and Boolean induction. General application strategies and limitations of the approach are also
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
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
Object exchange across heterogeneous information sources
 INTERNATIONAL CONFERENCE ON DATA ENGINEERING
, 1995
"... We address the problem of providing integrated access to diverse and dynamic information sources. We explain how this problem differs from the traditional database integration problem and we focus on one aspect of the information integration problem, namely information exchange. We define an object ..."
Abstract

Cited by 513 (57 self)
 Add to MetaCart
based information exchange model and a corresponding query language that we believe are well suited for integration of diverse information sources. We describe how, the model and language have been used to integrate heterogeneous bibliographic information sources. We also describe two generalpurpose libraries we
Results 1  10
of
237,565