Sciweavers

3032 search results - page 277 / 607
» Description Logic Rules
Sort
View
CSL
2006
Springer
15 years 10 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
FM
1997
Springer
159views Formal Methods» more  FM 1997»
15 years 10 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
AAAI
2007
15 years 9 months ago
Fluxplayer: A Successful General Game Player
General Game Playing (GGP) is the art of designing programs that are capable of playing previously unknown games of a wide variety by being told nothing but the rules of the game....
Stephan Schiffel, Michael Thielscher
COLING
1996
15 years 8 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
JAR
2010
123views more  JAR 2010»
15 years 5 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller