Sciweavers

438 search results - page 45 / 88
» On theorem proving in annotated logics
Sort
View
JCT
2006
110views more  JCT 2006»
14 years 9 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
CSL
2002
Springer
14 years 9 months ago
Open Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Herman Geuvers, Gueorgui I. Jojgov
CLIMA
2004
14 years 11 months ago
Symbolic Negotiation with Linear Logic
Abstract. Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. It has been demonstrated [19] how symbolic negotiation and distr...
Peep Küngas, Mihhail Matskin
CORR
2007
Springer
116views Education» more  CORR 2007»
14 years 9 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
PPDP
2010
Springer
14 years 7 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer