Results 1  10
of
22,698
A Formal Theory of Plan Recognition
, 1987
"... The problem of recognizing an agent's plans arises in many contexts in work in artificial intelligence. The plan recognition techniques suggested in the literature are rarely formally justified. We view plan recognition as a special kind of nonmonotonic reasoning, and demonstrate how formal te ..."
Abstract

Cited by 202 (3 self)
 Add to MetaCart
The problem of recognizing an agent's plans arises in many contexts in work in artificial intelligence. The plan recognition techniques suggested in the literature are rarely formally justified. We view plan recognition as a special kind of nonmonotonic reasoning, and demonstrate how formal
IN FORMAL THEORY
"... Within software’s life cycle, program testing is very important, since quality of specification demand, design and application must be proven. All definitions related to program testing are based on the same tendency and that is to give answer to the question: does the program behave in the requeste ..."
Abstract
 Add to MetaCart
Within software’s life cycle, program testing is very important, since quality of specification demand, design and application must be proven. All definitions related to program testing are based on the same tendency and that is to give answer to the question: does the program behave in the requested way? One of oldest and bestknown methods used in constructive testing of smaller programs is the symbolic program execution. One of ways to prove whether given program is written correctly is to execute it symbolically. Ramified program may be translated into declarative shape, i.e. into a clause sequence, and this translation may be automated. Method comprises of transformation part and resolution part.This work gives the description of the general frame for the investigation of the problem regarding program correctness, using the method of resolution invalidation.. It is shown how the rules of program logic can be used in the automatic resolution procedure. The examples of the realization on the LP prolog language are given (without limitation to Horn's clauses and without final failure).. The process of Pascal program execution in the LP system demonstrator is shown.
FORMAL THEORIES OF ACTION
, 1987
"... We apply circumscription to formalizing reasoning about the effects of actions in the framework of the situation calculus. The axiomatic description of causal connections between actions and changes allows us to solve the qualification problem and the frame problem using only simple forms of circums ..."
Abstract

Cited by 125 (2 self)
 Add to MetaCart
We apply circumscription to formalizing reasoning about the effects of actions in the framework of the situation calculus. The axiomatic description of causal connections between actions and changes allows us to solve the qualification problem and the frame problem using only simple forms
Formal Theories for Semantic Fusion
"... Abstract – A formal theory approach to semantic fusion is proposed and its philosophical, mathematical and computational development is illustrated through a formal theory for existence. ..."
Abstract
 Add to MetaCart
Abstract – A formal theory approach to semantic fusion is proposed and its philosophical, mathematical and computational development is illustrated through a formal theory for existence.
The psychological foundations of culture
 In
, 1992
"... One of the strengths of scientific inquiry is that it can progress with any mixture of empiricism, intuition, and formal theory that suits the convenience of the investigator. ..."
Abstract

Cited by 523 (27 self)
 Add to MetaCart
One of the strengths of scientific inquiry is that it can progress with any mixture of empiricism, intuition, and formal theory that suits the convenience of the investigator.
Formal and real authority in organizations
 The Journal of Political Economy
, 1997
"... This paper develops a theory of the allocation of formal authority (the right to decide) and real authority (the effective control over decisions) within organizations, and it illustrates how a formally integrated structure can accommodate various degrees of "real" integration. Real author ..."
Abstract

Cited by 856 (24 self)
 Add to MetaCart
This paper develops a theory of the allocation of formal authority (the right to decide) and real authority (the effective control over decisions) within organizations, and it illustrates how a formally integrated structure can accommodate various degrees of "real" integration. Real
ScaleSpace Theory in Computer Vision
, 1994
"... A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory fo ..."
Abstract

Cited by 625 (21 self)
 Add to MetaCart
A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory
on formal theories of dialogue
"... Neuropragmatics: neuropsychological constraints on formal theories of dialogue. Published (with modifications) in Brain and Language 59: 749. The modifications mentioned above consist of the following: In the published version no mention was made of Dante Alighieri's Commedia. This paper is c ..."
Abstract
 Add to MetaCart
Neuropragmatics: neuropsychological constraints on formal theories of dialogue. Published (with modifications) in Brain and Language 59: 749. The modifications mentioned above consist of the following: In the published version no mention was made of Dante Alighieri's Commedia. This paper
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
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 685 (12 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Results 1  10
of
22,698