Sciweavers

1269 search results - page 126 / 254
» Pi-Calculus in Logical Form
Sort
View
JOLLI
2006
106views more  JOLLI 2006»
15 years 5 months ago
Knowledge Condition Games
Agents often interact strategically to meet conditions involving their own or other agents' knowledge. This interaction can be modeled using a new method of game construction...
Sieuwert van Otterloo, Wiebe van der Hoek, Michael...
130
Voted
ENTCS
2002
71views more  ENTCS 2002»
15 years 5 months ago
A Simplified Account of the Metatheory of Linear LF
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
Joseph Vanderwaart, Karl Crary
CORR
1998
Springer
107views Education» more  CORR 1998»
15 years 5 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
145
Voted
RSCTC
2010
Springer
173views Fuzzy Logic» more  RSCTC 2010»
15 years 3 months ago
RSCTC'2010 Discovery Challenge: Mining DNA Microarray Data for Medical Diagnosis and Treatment
RSCTC’2010 Discovery Challenge was a special event of Rough Sets and Current Trends in Computing conference. The challenge was organized in the form of an interactive on-line com...
Marcin Wojnarski, Andrzej Janusz, Hung Son Nguyen,...
TCS
2010
15 years 3 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...