Sciweavers

3573 search results - page 218 / 715
» Reasoning about Codata
Sort
View
147
Voted
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 10 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
144
Voted
TPHOL
2008
IEEE
15 years 10 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
137
Voted
CBMS
2007
IEEE
15 years 10 months ago
Managing Conceptual Revisions in a Temporal Fungal Taxonomy
Representing and Reasoning about time and change is one of the primary issues in the area of Artificial Intelligence (AI) and Knowledge Representation (KR). Despite the importance...
Arash Shaban-Nejad, Volker Haarslev
131
Voted
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
15 years 10 months ago
Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems
— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
Uluc Saranli, Frank Pfenning
TIME
2007
IEEE
15 years 10 months ago
Constructing a Temporal Relation Tagged Corpus of Chinese Based on Dependency Structure Analysis
This paper describes an annotation guideline for a temporal relation-tagged corpus of Chinese. Our goal is construction of corpora to be used for a corpus-based analysis of tempor...
Yuchang Cheng, Masayuki Asahara, Yuji Matsumoto