Sciweavers

746 search results - page 128 / 150
» Connectionist Propositional Logic
Sort
View
AUSAI
2007
Springer
15 years 2 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
RTA
2010
Springer
15 years 1 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 1 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
DEON
2006
Springer
15 years 1 months ago
Speech Acts with Institutional Effects in Agent Societies
A general logical framework is presented to represent speech acts that have institutional effects. It is based on the concepts of the Speech Act Theory and takes the form of the FI...
Robert Demolombe, Vincent Louis