Results 11  20
of
6,074
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
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
2.2 Basic logical definitions............................................... 28 Contents
, 2009
"... 1.2 Short overview of the different logics....................................... 9 ..."
Abstract
 Add to MetaCart
1.2 Short overview of the different logics....................................... 9
SemiringInduced Propositional Logic: Definition and Basic Algorithms
"... In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that different instantiations of the semiring model different interesting computational problems such as finding a model, coun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that different instantiations of the semiring model different interesting computational problems such as finding a model
An Inductive Principle for Learning Logical Definitions from Relations
, 1994
"... Induction for Horn clauses from data received a major boost from the success of FOIL 1;2;3 as a pioneer clausal learning algorithm. FOIL attempts to explain a target relation (while avoiding a negative set) by incrementally adding clauses that successively increase this explained part. The resi ..."
Abstract
 Add to MetaCart
Induction for Horn clauses from data received a major boost from the success of FOIL 1;2;3 as a pioneer clausal learning algorithm. FOIL attempts to explain a target relation (while avoiding a negative set) by incrementally adding clauses that successively increase this explained part. The residue of the target set is obtained by postulating the target set in the antecedents (body) of the generated clauses. In contrast to this, if one considers the conventional least model semantics of Horn clauses, this semantics is realized operationally by a fixed point computation from the set of facts. In this paper we consider a variant of FOIL in which the clause search is like in FOIL ? but the residue of the target is computed differently. This residue computation is motivated by fixed point theory i.e. the residue of target set is obtained by using the generated (explained) part of target set in the antecedents (body) of the generated clauses. The current generated clauses toge...
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
problems of lower complexity in a simpler and more natural fashion. This paper presents the DLV system, which is widely considered the stateoftheart implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel
Relative absorptive capacity and interorganizational learning
 STRATEGIC MANAGEMENT JOURNAL
, 1998
"... Much of the prior research on interorganizational learning has focused on the role of absorptive capacity, a firm’s ability to value, assimilate, and utilize new external knowledge. However, this definition of the construct suggests that a firm has an equal capacity to learn from all other organizat ..."
Abstract

Cited by 463 (2 self)
 Add to MetaCart
Much of the prior research on interorganizational learning has focused on the role of absorptive capacity, a firm’s ability to value, assimilate, and utilize new external knowledge. However, this definition of the construct suggests that a firm has an equal capacity to learn from all other
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
A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions
, 1996
"... this paper we consider another resource: the quantity of information, included in the problem, which is made formal using Kolmogorov complexity. Thus the nonuniform definition must include the same amount of information, and this manifests in the length of sentences forming the definition. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this paper we consider another resource: the quantity of information, included in the problem, which is made formal using Kolmogorov complexity. Thus the nonuniform definition must include the same amount of information, and this manifests in the length of sentences forming the definition.
Section A.2 Philosophical Logic DEFINITIONAL REFLECTION AND CIRCULAR REASONING
"... The theory of definitional reflection provides a novel framework for studying logical features of circular, and especially paradoxical reasoning. Definitional reflection originated from reading clauses for atoms as definitions, thereby extending ideas concerning elimination rules in natural deductio ..."
Abstract
 Add to MetaCart
The theory of definitional reflection provides a novel framework for studying logical features of circular, and especially paradoxical reasoning. Definitional reflection originated from reading clauses for atoms as definitions, thereby extending ideas concerning elimination rules in natural
Results 11  20
of
6,074