Sciweavers

8828 search results - page 1315 / 1766
» Formal methods in practice
Sort
View
NMR
2004
Springer
16 years 12 days ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
WADT
2004
Springer
16 years 12 days ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
AGTIVE
2003
Springer
16 years 9 days ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
AGTIVE
2003
Springer
16 years 9 days ago
Modeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
Ingrid Fischer
COMPSAC
2002
IEEE
16 years 1 days ago
A Simple Mathematically Based Framework for Rule Extraction from an Arbitrary Programming Language
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
Frederick V. Ramsey, James J. Alpigini
« Prev « First page 1315 / 1766 Last » Next »