Sciweavers

344 search results - page 17 / 69
» Some Theorems We Should Prove
Sort
View
COLING
2002
13 years 7 months ago
An Inference-based Approach to Dialogue System Design
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...
Johan Bos, Tetsushi Oka
COMBINATORICS
2007
58views more  COMBINATORICS 2007»
13 years 7 months ago
The Initial Involution Patterns of Permutations
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
Dongsu Kim, Jang Soo Kim
ENTCS
2008
79views more  ENTCS 2008»
13 years 7 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
DCG
2010
64views more  DCG 2010»
13 years 7 months ago
Multiplicity mod 2 as a Metric Invariant
We study the multiplicity modulo 2 of real analytic hypersurfaces. We prove that, under some assumptions on the singularity, the multiplicity modulo 2 is preserved by subanalytic b...
Guillaume Valette
BIRTHDAY
1991
Springer
13 years 11 months ago
The Markgraf Karl Refutation Procedure
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
Hans Jürgen Ohlbach, Jörg H. Siekmann