Sciweavers

767 search results - page 83 / 154
» Logic for Mathematical Writing
Sort
View
UAI
1993
15 years 4 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
ICLP
2011
Springer
14 years 6 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
FSTTCS
2008
Springer
15 years 4 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
16 years 3 days ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
TASE
2009
IEEE
15 years 10 months ago
Semantics of Metamodels in UML
A modelling language can be defined by a metamodel in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamod...
Lijun Shan, Hong Zhu