Sciweavers

3044 search results - page 57 / 609
» Linear logical approximations
Sort
View
CLIMA
2004
13 years 10 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
JSYML
2000
110views more  JSYML 2000»
13 years 8 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...
ML
2008
ACM
174views Machine Learning» more  ML 2008»
13 years 8 months ago
ALLPAD: approximate learning of logic programs with annotated disjunctions
In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). ALLPAD modifies the previous system LLPAD in order to tackle real world ...
Fabrizio Riguzzi
APLAS
2010
ACM
13 years 9 months ago
A Logical Mix of Approximation and Separation
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
FOSSACS
2007
Springer
14 years 21 days ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...