Results 1 - 10 of 13,673

Learning Stochastic Logic Programs

by Stephen Muggleton , 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first-order r ..."
Abstract - Cited by 1194 (81 self) - Add to MetaCart
-order range-restricted definite clause. This paper summarises the syntax, distributional semantics and proof techniques for SLPs and then discusses how a standard Inductive Logic Programming (ILP) system, Progol, has been modied to support learning of SLPs. The resulting system 1) nds an SLP with uniform

A Spatial Logic based on Regions and Connection

by David A. Randell, Zhan Cui, Anthony G. Cohn - 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 745 (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

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
to the logics of the DL-Lite family make query answering at least NLogSpace in data complexity, thus ruling out the possibility of using on-the-shelf relational technology for query processing, we can conclude that the logics of the DL-Lite family are the maximal DLs supporting efficient query answering over

PVS: A Prototype Verification System

by S. Owre, J. M. Rushby, N. Shankar - CADE , 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract - Cited by 655 (16 self) - Add to MetaCart
automation for an impoverished logic, and others that feature expressive logics but only limited automation. PVS attempts to tread the middle ground between these two classes by providing mechanical assistance to support clear and abstract specifications, and readable yet sound proofs for difficult theorems

The Application of Petri Nets to Workflow Management

by W.M.P. Van Der Aalst , 1998
"... Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the ..."
Abstract - Cited by 533 (64 self) - Add to MetaCart
Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses

Answering Queries Using Views: A Survey

by Alon Y. Halevy , 2000
"... The problem of answering queries using views is to find efficient methods of answering a query using a set of previously defined materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a w ..."
Abstract - Cited by 562 (32 self) - Add to MetaCart
wide variety of data management problems. In query optimization, finding a rewriting of a query using a set of materialized views can yield a more efficient query execution plan. To support the separation of the logical and physical views of data, a storage schema can be described using views over

The “What” and “Why” of Goal Pursuits: Human Needs and the Self-Determination of Behavior

by Edward L. Deci, Richard M. Ryan , 2000
"... Self-determination theory (SDT) maintains that an understanding of human motiva-tion requires a consideration of innate psychological needs for competence, auton-omy, and relatedness. We discuss the SDT concept of needs as it relates to previous need theories, emphasizing that needs specify the nece ..."
Abstract - Cited by 1105 (36 self) - Add to MetaCart
relations to the quality of behavior and mental health, specifically be-cause different regulatory processes and different goal contents are associated with differing degrees of need satisfaction. Social contexts and individual differences that support satisfaction of the basic needs facilitate natural

On the Plurality of Worlds

by David Lewis, Louis Derosset , 1986
"... David Lewis is one of the most influential philosophers of our age, and On the Plurality of Worlds is his magnum opus. OPW1 offers an extended development and defense of the hypothesis that there are many universes, things of the same kind as the universe in which we all live, move, and have our bei ..."
Abstract - Cited by 687 (2 self) - Add to MetaCart
being. Lewis calls these universes ―worlds‖, deliberately recalling the notion of a ―possible world ‖ familiar from modal logic and the metaphysics of modality. The title invokes the thesis of the book: there are pluralities of worlds, things of the same kind as the world we inhabit, differing only

The Foundation of a Generic Theorem Prover

by Lawrence C. Paulson - 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 meta-logic (or `logical framework') in which the object-logics are formalized. Isabell ..."
Abstract - Cited by 471 (48 self) - Add to MetaCart
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 meta-logic (or `logical framework') in which the object-logics are formalized

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

by John Mccarthy , 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract - Cited by 457 (3 self) - Add to MetaCart
this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science
Results 1 - 10 of 13,673