Sciweavers

1269 search results - page 53 / 254
» Pi-Calculus in Logical Form
Sort
View
APAL
2007
78views more  APAL 2007»
13 years 10 months ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
CSL
2009
Springer
14 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
VL
2007
IEEE
125views Visual Languages» more  VL 2007»
14 years 4 months ago
Visual Reasoning by Generalized Interval-values and Interval Temporal Logic
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...
Benedek Nagy, Sándor Vályi
WOA
2000
13 years 11 months ago
Expressing Collaboration And Competition Among Abductive Logic Agents
This paper presents a language for coordinating several logic-based agents capable of abductive reasoning. The system is particularly suited for solving problems with incomplete k...
Anna Ciampolini, Evelina Lamma, Paola Mello, Paolo...
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 10 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin