Results 1  10
of
9,190
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
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 795 (42 self)
 Add to MetaCart
conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higherorder judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logicindependent tools such as proof editors and proof checkers
Logical, conditional, and classical probability
, 2005
"... The propositional logic is generalized on the real numbers field. the logical function with all properties of the classical probability function is obtained. The logical analog of the Bernoulli independent tests scheme is constructed. The logical analog of the Large Number Law is deduced from proper ..."
Abstract
 Add to MetaCart
properties of these functions. The logical analog of thd conditional probability is defined. Consistency encured by a model on a suitable variant of the nonstandard analysis. 1
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 688 (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 “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
Preference logic, conditionals, and solution concepts in games
 Krister Segerberg. University of Uppsala
, 2005
"... Preference is a basic notion in human behaviour, underlying such varied phenomena as individual rationality in the philosophy of action and game theory, obligations in deontic logic (we should aim for the best of all possible worlds), or collective decisions in social choice theory. Also, in a more ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
Preference is a basic notion in human behaviour, underlying such varied phenomena as individual rationality in the philosophy of action and game theory, obligations in deontic logic (we should aim for the best of all possible worlds), or collective decisions in social choice theory. Also, in a more
DIVA: A Reliable Substrate for Deep Submicron Microarchitecture Design
 In Proc. 32nd Annual Intl. Symp. on Microarchitecture
, 1999
"... Building a highpetformance microprocessor presents many reliability challenges. Designers must verify the correctness of large complex systems and construct implementations that work reliably in varied (and occasionally adverse) operating conditions. To&rther complicate this task, deep submicro ..."
Abstract

Cited by 374 (15 self)
 Add to MetaCart
Building a highpetformance microprocessor presents many reliability challenges. Designers must verify the correctness of large complex systems and construct implementations that work reliably in varied (and occasionally adverse) operating conditions. To&rther complicate this task, deep
Specification Matching of Software Components
 ACM Transactions on Software Engineering and Methodology
, 1996
"... Specification matching is a way to compare two software components based on descriptions of the components' behaviors. In the context of software reuse and library retrieval, it can help determine whether one component can be substituted for another or how one can be modified to fit the requ ..."
Abstract

Cited by 358 (4 self)
 Add to MetaCart
of not just exact match, but more relevantly, various flavors of relaxed match. These definitions capture the notions of generalization, specialization, and substitutability of software components. Since our formal specifications are pre and postconditions written as predicates in firstorder logic, we
What Does a Conditional Knowledge Base Entail?
 Artificial Intelligence
, 1989
"... This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type if . . . then . . . , represents the explicit defeasible knowledge an agent has abo ..."
Abstract

Cited by 277 (6 self)
 Add to MetaCart
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type if . . . then . . . , represents the explicit defeasible knowledge an agent has
TLCharts: Armorplating Harel Statecharts with Temporal Logic Conditions
 in Proc. of the 15 th IEEE Int. Workshop on Rapid System Prototyping
, 2004
"... This paper addresses the need for armorplating Harel Statechart design specifications of realtime systems with safety requirements (which are commonly written in temporal logic) using a new visual specification language named TLCharts. TLCharts combine the visual and intuitive appeal of nondete ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper addresses the need for armorplating Harel Statechart design specifications of realtime systems with safety requirements (which are commonly written in temporal logic) using a new visual specification language named TLCharts. TLCharts combine the visual and intuitive appeal of non
Results 1  10
of
9,190