Sciweavers

2303 search results - page 251 / 461
» On the logic of argumentation theory
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ATAL
2008
Springer
15 years 7 months ago
Anchoring institutions in agents' attitudes: towards a logical framework for autonomous multi-agent systems
The aim of this paper is to provide a logical framework for the specification of autonomous Multi-Agent Systems (MAS). A MAS is autonomous in so far as it is capable of binding (...
Benoit Gaudou, Dominique Longin, Emiliano Lorini, ...
IANDC
2008
122views more  IANDC 2008»
15 years 6 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
CORR
2007
Springer
79views Education» more  CORR 2007»
15 years 6 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien
FOSSACS
1999
Springer
15 years 11 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro