Sciweavers

838 search results - page 58 / 168
» From Natural Language to Formal Proof Goal
Sort
View
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
15 years 10 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
AI
1998
Springer
15 years 5 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
CSLP
2004
Springer
15 years 11 months ago
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czech
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...
Ondrej Bojar
EDOC
2004
IEEE
15 years 9 months ago
Formalizing ODP Computational Viewpoint Specifications in Maude
The ODP computational viewpoint describes the functionality of a system and its environment, in terms of a configuration of objects which interact at interfaces. Computational obj...
José Raúl Romero, Antonio Vallecillo
ECOOP
2009
Springer
16 years 6 months ago
From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
Friedrich Steimann, Andreas Thies