Sciweavers

615 search results - page 21 / 123
» Completeness of Combinations of Constructor Systems
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
HICSS
2005
IEEE
112views Biometrics» more  HICSS 2005»
14 years 1 months ago
Activity Patterns of Pair Programming
This paper reports results from an exploratory study investigating the activity patterns of pair programming using a student project conducted over a period of nine weeks. We foun...
Lan Cao, Peng Xu
IGPL
2010
156views more  IGPL 2010»
13 years 6 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
NIPS
2008
13 years 9 months ago
Simple Local Models for Complex Dynamical Systems
We present a novel mathematical formalism for the idea of a "local model" of an uncontrolled dynamical system, a model that makes only certain predictions in only certai...
Erik Talvitie, Satinder Singh
AAAI
1998
13 years 9 months ago
Discovering Admissible Simultaneous Equations of Large Scale Systems
SSFisasystemtodiscoverthestructureofsimultaneous equations governing an objective process through experiments. SSF combined with another system SDS to discover a quantitative form...
Takashi Washio, Hiroshi Motoda