Sciweavers

1941 search results - page 166 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
CSL
2010
Springer
15 years 4 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
119
Voted
PLILP
1995
Springer
15 years 7 months ago
Local Linear Logic for Locality Consciousness in Multiset Transformation
We use Girard's linear logic (LL) to produce a semantics for Gamma, a multiset transformation language. The semantics improves on the existing structured operational semantics...
Hugh McEvoy, Pieter H. Hartel
241
Voted
POPL
2008
ACM
16 years 3 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
132
Voted
AAAI
2007
15 years 5 months ago
DL-Lite in the Light of First-Order Logic
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
151
Voted
ATAL
2006
Springer
15 years 7 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...