Results 1  10
of
8,957
Monitors: An Operating System Structuring Concept
 Communications of the ACM
, 1974
"... This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, descri ..."
Abstract

Cited by 566 (0 self)
 Add to MetaCart
This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization
Hierarchical Proof Structures
"... Abstract. Motivated by structure arising in tacticbased theorem proving, we develop the concept of hierarchical proof tree or hiproof by characterising a geometrically natural definition in terms of its family of proof views. We first recall a definition of hierarchical proof tree, explaining its a ..."
Abstract
 Add to MetaCart
Abstract. Motivated by structure arising in tacticbased theorem proving, we develop the concept of hierarchical proof tree or hiproof by characterising a geometrically natural definition in terms of its family of proof views. We first recall a definition of hierarchical proof tree, explaining its
Rewritings in Polarized (Partial) Proof Structures?
"... Abstract. This paper is a first step towards a study for a concurrent construction of proofnets in the framework of linear logic after Andreoli’s works, by taking care of the properties of the structures. We limit here to multiplicative linear logic. We first give a criterion for closed modules (i. ..."
Abstract
 Add to MetaCart
Abstract. This paper is a first step towards a study for a concurrent construction of proofnets in the framework of linear logic after Andreoli’s works, by taking care of the properties of the structures. We limit here to multiplicative linear logic. We first give a criterion for closed modules (i
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 876 (65 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
proving or modelchecking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
A tutorial on support vector machines for pattern recognition
 Data Mining and Knowledge Discovery
, 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract

Cited by 3393 (12 self)
 Add to MetaCart
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and nonseparable data, working through a nontrivial example in detail. We describe a mechanical analogy, and discuss when
A solution to the simultaneous localization and map building (SLAM) problem
 IEEE Transactions on Robotics and Automation
, 2001
"... Abstract—The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then to incrementally build a map of this environment while simultaneously using this map to compute absolute vehicle ..."
Abstract

Cited by 505 (30 self)
 Add to MetaCart
location. Starting from the estimationtheoretic foundations of this problem developed in [1]–[3], this paper proves that a solution to the SLAM problem is indeed possible. The underlying structure of the SLAM problem is first elucidated. A proof that the estimated map converges monotonically to a relative
Correctness of Multiplicative Additive Proof Structures is NLComplete
"... We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomplete. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomplete.
Topological Correctness Criteria for Linear Logic Proof Structures
"... Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoretical way of dealing with proofs and cut elimination. These tasks were traditionally carried out by means of Gentzen sequent calculi with the consequence that the most part of these works were engrossed by tedious commut ..."
Abstract
 Add to MetaCart
ingredients of a proof net syntax are: – a graphical syntax (i.e., proof structures), – a topological correctness criterion, defining proof nets among proof structures, – an interpretation of the sequent calculus syntax, – a cut elimination procedure. The main properties under consideration for a good notion
Correctness of multiplicative (and exponential) proof structures is l complete
 Lecture Notes in Computer Science
, 2007
"... Abstract. We provide a new correctness criterion for unitfree MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof structure is NLcomplete. We also prove that deciding the correctness of an intuitionistic multiplicative ess ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We provide a new correctness criterion for unitfree MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof structure is NLcomplete. We also prove that deciding the correctness of an intuitionistic multi
Results 1  10
of
8,957