Sciweavers

5608 search results - page 187 / 1122
» On the Theory of Matchgate Computations
Sort
View
CALCO
2009
Springer
139views Mathematics» more  CALCO 2009»
15 years 8 months ago
Traces, Executions and Schedulers, Coalgebraically
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
Bart Jacobs, Ana Sokolova
SYNASC
2006
IEEE
64views Algorithms» more  SYNASC 2006»
15 years 7 months ago
Scheme-Based Systematic Exploration of Natural Numbers
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
Madalina Hodorog, Adrian Craciun
116
Voted
CONCUR
2006
Springer
15 years 5 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink
150
Voted
CONCUR
2008
Springer
15 years 3 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
AAAI
1994
15 years 3 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe