Sciweavers

4401 search results - page 462 / 881
» Computing with Default Logic
Sort
View
MKM
2004
Springer
16 years 6 days ago
Intuitive and Formal Representations: The Case of Matrices
A major obstacle for bridging the gap between textbook mathematics and formalising it on a computer is the problem how to adequately capture the intuition inherent in the mathemati...
Martin Pollet, Volker Sorge, Manfred Kerber
PADL
2004
Springer
16 years 6 days ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
TYPES
2004
Springer
16 years 6 days ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
181
Voted
EDOC
2003
IEEE
16 years 5 days ago
A Model-Driven Transformation Method
Model-driven architectures (MDA) separate the business or application logic from the underlying platform technology and represent this logic with precise semantic models. These mo...
Jana Koehler, Rainer Hauser, Shubir Kapoor, Freder...
210
Voted
ERLANG
2003
ACM
16 years 3 days ago
ARMISTICE: an experience developing management software with Erlang
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...