Results 11  20
of
17,581
Representing Action and Change by Logic Programs
 Journal of Logic Programming
, 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract

Cited by 414 (25 self)
 Add to MetaCart
semantics of action based on states and transition functions. 1 Introduction This paper extends the work of Eshghi and Kowalski [6], Evans [7] and Apt and Bezem [1] on representing properties of actions in logic programming languages with negation as failure. Our goal is to overcome some of the limitations
The “What” and “Why” of Goal Pursuits: Human Needs and the SelfDetermination of Behavior
, 2000
"... Selfdetermination theory (SDT) maintains that an understanding of human motivation requires a consideration of innate psychological needs for competence, autonomy, 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
the necessary conditions for psychological growth, integrity, and wellbeing. This concept of needs leads to the hypotheses that different regulatory processes underlying goal pursuits are differentially associated with effective functioning and wellbeing and also that different goal contents have different
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
Knowledge Interchange Format Version 3.0 Reference Manual
, 1992
"... : Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract

Cited by 484 (14 self)
 Add to MetaCart
); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the firstorder predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides
The Disjunctive Decomposition of Logic Functions
 Proc. ICCAD ‘97
, 1997
"... In this paper we present an algorithm for converting a BDD representation of a logic function into a multiplelevel netlist of disjointsupport subfunctions. On the theoretical side, we show that the algorithm takes at most quadratic time in the size of the BDD and that the resulting netlist retains ..."
Abstract
 Add to MetaCart
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiplelevel netlist of disjointsupport subfunctions. On the theoretical side, we show that the algorithm takes at most quadratic time in the size of the BDD and that the resulting netlist
On BiDecompositions of Logic Functions
 Proc. of IWLS '97, Tahoe City
, 1997
"... A logic function f has a disjoint bidecomposition iff f can be represented as f = h(g 1 (X 1 );g 2 (X 2 )), where X 1 and X 2 are disjoint set of variables, and h is an arbitrary twovariable logic fuction. f has a nondisjoint bidecomposition iff f can be represented as f(X 1 ;X 2 ;x)= h(g 1 (X 1 ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
A logic function f has a disjoint bidecomposition iff f can be represented as f = h(g 1 (X 1 );g 2 (X 2 )), where X 1 and X 2 are disjoint set of variables, and h is an arbitrary twovariable logic fuction. f has a nondisjoint bidecomposition iff f can be represented as f(X 1 ;X 2 ;x)= h(g 1 (X
Control of Systems Integrating Logic, Dynamics, and Constraints
 Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract

Cited by 413 (50 self)
 Add to MetaCart
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 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
applications of our recursive function formalism to mathematical logic and to the problem of mechanical theorem proving. 2 Functions and Function Definitions
An algorithm for bidecomposition of logic functions
 Proc. DAC '01
, 2001
"... We propose a new BDDbased method for decomposition of multioutput incompletely specified logic functions into netlists of twoinput logic gates. The algorithm uses the internal don’tcares during the decomposition to produce compact wellbalanced netlists with short delay. The resulting netlists a ..."
Abstract

Cited by 53 (19 self)
 Add to MetaCart
We propose a new BDDbased method for decomposition of multioutput incompletely specified logic functions into netlists of twoinput logic gates. The algorithm uses the internal don’tcares during the decomposition to produce compact wellbalanced netlists with short delay. The resulting netlists
Towards Logic Functions as the Device
"... Abstract This paper argues for alternate state variables and new types of sophisticated devices that implement more functionality in one computational step than typical devices based on simple switches. Elementary excitations in solids enabling wave interactions are possible initial candidates to c ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
to create such new devices. The paper focuses on magnonbased spinwavelogic functions (SPWF) and presents high fanin majority, weighted high fanin majority, and frequencymultiplexed weighted high fanin majority devices as initial SPWFs. Experiments proving feasibility are also shown. Benefits vs
Results 11  20
of
17,581