Sciweavers

329 search results - page 59 / 66
» Resolution-based argumentation semantics
Sort
View
147
Voted
ICCS
2004
Springer
15 years 8 months ago
Types and Tokens for Logic with Diagrams
It is well accepted that diagrams play a crucial role in human reasoning. But in mathematics, diagrams are most often only used for visualizations, but it is doubted that diagrams ...
Frithjof Dau
109
Voted
EDOC
2003
IEEE
15 years 8 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
120
Voted
TAMC
2010
Springer
15 years 7 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
116
Voted
ICFP
1999
ACM
15 years 7 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
130
Voted
POPL
1998
ACM
15 years 6 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks