Results 1  10
of
219,191
The Discovery of Logical Propositions ¯ Numermal Data¯
"... Abstract: This paper presents a method to discover logical propositions in numerical data. The method is based on the space of multilinear functions, which is made into a Euclidean space. A function obtained by multiple regression analysis in which data are normalized to [0,1] belongs to this Eucli ..."
Abstract
 Add to MetaCart
Abstract: This paper presents a method to discover logical propositions in numerical data. The method is based on the space of multilinear functions, which is made into a Euclidean space. A function obtained by multiple regression analysis in which data are normalized to [0,1] belongs
Andersonian deontic logic, propositional quantification
 and Mally. Notre Dame Journal of Formal Logic
"... Abstract We present a new axiomatization of the deontic fragment of Anderson’s relevant deontic logic, give an Andersonian reduction of a relevant version of Mally’s deontic logic previously discussed in this journal, study the effect of adding propositional quantification to Anderson’s system, and ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract We present a new axiomatization of the deontic fragment of Anderson’s relevant deontic logic, give an Andersonian reduction of a relevant version of Mally’s deontic logic previously discussed in this journal, study the effect of adding propositional quantification to Anderson’s system
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract

Cited by 578 (33 self)
 Add to MetaCart
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning
QUINE ON LOGIC, PROPOSITIONAL ATTITUDES, AND THE UNITY OF KNOWLEDGE
"... I shall examine Quine’s conception of logic, of propositional attitudes, and of the unity of knowledge in order to show that there are some tensions in Quine’s system. I first propose a conception of the use or application of logic, stating that logic strictly speaking applies to intentional phenome ..."
Abstract
 Add to MetaCart
I shall examine Quine’s conception of logic, of propositional attitudes, and of the unity of knowledge in order to show that there are some tensions in Quine’s system. I first propose a conception of the use or application of logic, stating that logic strictly speaking applies to intentional
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1387 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Qualitative Modeling of Spatial Orientation Processes using Logical Propositions: Interconnecting . . .
 SPATIAL PRESENCE, SPATIAL UPDATING, PILOTING, AND SPATIAL COGNITION.”, TECHNICAL REPORT N. 100, MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS
, 2002
"... In this paper, we introduce first steps towards a logically consistent framework describing and relating items concerning the phenomena of spatial orientation processes, namely spatial presence, spatial updating, piloting, and spatial cognition. Spatial presence can for this purpose be seen as the ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
In this paper, we introduce first steps towards a logically consistent framework describing and relating items concerning the phenomena of spatial orientation processes, namely spatial presence, spatial updating, piloting, and spatial cognition. Spatial presence can for this purpose be seen
The fundamental properties of natural numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract

Cited by 685 (73 self)
 Add to MetaCart
. The following proposition is true (2) 1 For every X such that 0 ∈ X and for every x such that x ∈ X holds x+1 ∈ X and for every k holds k ∈ X. Let n, k be natural numbers. Then n+k is a natural number. Let n, k be natural numbers. Note that n+k is natural. In this article we present several logical schemes
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 [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
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 365 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical
Encoding Plans in Propositional Logic
, 1996
"... In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings for STRIP ..."
Abstract

Cited by 173 (9 self)
 Add to MetaCart
In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings
Results 1  10
of
219,191