Sciweavers

1193 search results - page 78 / 239
» A primer of simple theories
Sort
View
JSYML
2007
62views more  JSYML 2007»
14 years 11 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
ENTCS
2002
152views more  ENTCS 2002»
14 years 11 months ago
Contract-based mutation testing in the refinement calculus
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
Bernhard K. Aichernig
ENTCS
2002
95views more  ENTCS 2002»
14 years 11 months ago
Deriving Bisimulation Congruences: A 2-categorical Approach
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
Vladimiro Sassone, Pawel Sobocinski
KI
2008
Springer
14 years 10 months ago
Simplest Scenario for Mutual Nested Modeling in Human-Machine-Interaction
The research aim of this paper is to represent everydaylife patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is inv...
Rustam Tagiew
SANSKRIT
2010
14 years 9 months ago
Sanskrit Compound Processor
Sanskrit is very rich in compound formation. Typically a compound does not code the relation between its components explicitly. To understand the meaning of a compound, it is neces...
Anil Kumar, Vipul Mittal, Amba Kulkarni