Sciweavers

CSL
2008
Springer
14 years 21 days ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
DEON
2006
Springer
14 years 26 days ago
Delegation of Power in Normative Multiagent Systems
In this paper we reconsider the definition of counts-as relations in normative multiagent systems: counts-as relations do not always provide directly act interpretation of brute fa...
Guido Boella, Leendert W. N. van der Torre
DEON
2006
Springer
14 years 26 days ago
A Logical Architecture of a Normative System
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
Guido Boella, Leendert W. N. van der Torre
DEON
2006
Springer
14 years 26 days ago
Addressing Moral Problems Through Practical Reasoning
Abstract. In this paper, following the work of Hare, we consider moral reasoning not as the application of moral norms and principles, but as reasoning about what ought to be done ...
Katie Atkinson, Trevor J. M. Bench-Capon
ASP
2005
Springer
14 years 27 days ago
Exploiting ASP for Semantic Information Extraction
Abstract. The paper describes HıLεX, a new ASP-based system for the extraction of information from unstructured documents. Unlike previous systems, which are mainly syntactic, HÄ...
Massimo Ruffolo, Nicola Leone, Marco Manna, Domeni...
KR
2010
Springer
14 years 27 days ago
Independence and Functional Dependence Relations on Secrets
We study logical principles connecting two relations: independence, which is known as nondeducibility in the study of information flow, and functional dependence. Two different e...
Robert Kelvey, Sara Miner More, Pavel Naumov, Benj...
KR
2010
Springer
14 years 27 days ago
Integrating Action Calculi and AgentSpeak: Closing the Gap
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
Michael Thielscher
DLOG
2008
14 years 1 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...