AIICS

Patrick Doherty

In Book or Collection

Hide abstracts BibTeX entries
2018
[14] Patrick Doherty and Andrzej Szalas. 2018.
Signed Dual Tableaux for Kleene Answer Set Programs.
In Golińska-Pilarek J., Zawidzki M., editors, Ewa Orłowska on Relational Methods in Logic and Computer Science, pages 233–252. In series: Outstanding Contributions to Logic #17. Springer. ISBN: 9783319978789, 9783319978796.
DOI: 10.1007/978-3-319-97879-6_9.

<em>Dual tableaux</em> were introduced by Rasiowa and Sikorski (1960) as a cut free deduction system for classical first-order logic. In the current paper, a sound and complete proof procedure based on dual tableaux is proposed for<em> R</em><sub><em>3</em> </sub>which is the standard Kleene logic augmented with a weak negation connective and an implication connective proposed, in another context, by Shepherdson (1989).<em> R<sub>3</sub></em>is used as a basis for defining Kleene Answer Set Programs (ASP<em><sup>K</sup></em>programs). The semantics forASP<em><sup>K</sup></em>programs is based on strongly supported models. Both entailment procedures and model generation procedures for normal and non-normalASP<em><sup>K</sup></em>programs are proposed based on the use of dual tableaux and a model filtering technique. The dual tableau proof procedure extended with a model filtering technique is shown to be sound and complete forASP<em><sup>K</sup></em>programs, both normal and non-normal. Since there is a direct relationship between answer sets for classical ASP programs and<em>R<sub>3</sub></em>models forASP<sup>K</sup>programs, it can be shown that the sound and complete dual tableaux proof procedure with filtering for ASPK\" role=\"presentation\"&gt;ASPKprograms is also sound and complete for classical normal ASP programs. For classical non-normal ASP programs, the proof procedure is only sound, since an alternative semantics for disjunction is used inASP<sup>K </sup>

2015
[13] Full text  Patrick Doherty and Andrzej Szalas. 2015.
Stability, Supportedness, Minimality and Kleene Answer Set Programs.
In Thomas Eiter, Hannes Strass, Mirosław Truszczynski, Stefan Woltran, editors, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation: Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, pages 125–140. In series: Lecture Notes in Computer Science #9060. Springer. ISBN: 978-3-319-14725-3, 978-3-319-14726-0.
DOI: 10.1007/978-3-319-14726-0_9.
Link to full text: http://www.ida.liu.se/divisions/aiics/pu...
fulltext:postprint: http://liu.diva-portal.org/smash/get/div...

Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of an answer set is supported through facts and chains of rules and those members are in the answer set only if generated minimally in such a manner. These two characteristics, supportedness and minimality, provide the essence of stable models. Additionally, answer sets are implicitly partial and that partiality provides epistemic overtones to the interpretation of disjunctiver ules and default negation. This paper is intended to shed light on these characteristics by defining a semantic framework for answer set programming based on an extended first-order Kleene logic with weak and strong negation. Additionally, a definition of strongly supported models is introduced, separate from the minimality assumption explicit in stable models. This is used to both clarify and generate alternative semantic interpretations for answer set programs with disjunctive rules in addition to answer set programs with constraint rules. An algorithm is provided for computing supported models and comparative complexity results between strongly supported and stable model generation are provided.

2014
[12] Full text  Patrick Doherty, Jonas Kvarnström, Mariusz Wzorek, Piotr Rudol, Fredrik Heintz and Gianpaolo Conte. 2014.
HDRC3 - A Distributed Hybrid Deliberative/Reactive Architecture for Unmanned Aircraft Systems.
In Kimon P. Valavanis, George J. Vachtsevanos, editors, Handbook of Unmanned Aerial Vehicles, pages 849–952. Springer Science+Business Media B.V.. ISBN: 978-90-481-9706-4, 978-90-481-9707-1.
DOI: 10.1007/978-90-481-9707-1_118.
Find book at a Swedish library/Hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/16541662
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?qt=worldc...

This chapter presents a distributed architecture for unmanned aircraft systems that provides full integration of both low autonomy and high autonomy. The architecture has been instantiated and used in a rotorbased aerial vehicle, but is not limited to use in particular aircraft systems. Various generic functionalities essential to the integration of both low autonomy and high autonomy in a single system are isolated and described. The architecture has also been extended for use with multi-platform systems. The chapter covers the full spectrum of functionalities required for operation in missions requiring high autonomy. A control kernel is presented with diverse flight modes integrated with a navigation subsystem. Specific interfaces and languages are introduced which provide seamless transition between deliberative and reactive capability and reactive and control capability. Hierarchical Concurrent State Machines are introduced as a real-time mechanism for specifying and executing low-level reactive control. Task Specification Trees are introduced as both a declarative and procedural mechanism for specification of high-level tasks. Task planners and motion planners are described which are tightly integrated into the architecture. Generic middleware capability for specifying data and knowledge flow within the architecture based on a stream abstraction is also described. The use of temporal logic is prevalent and is used both as a specification language and as an integral part of an execution monitoring mechanism. Emphasis is placed on the robust integration and interaction between these diverse functionalities using a principled architectural framework. The architecture has been empirically tested in several complex missions, some of which are described in the chapter.

2012
[11] Patrick Doherty and John-Jules Ch. Meyer. 2012.
On the Logic of Delegation - Relating Theory and Practice.
In Fabio Paglieri, Luca Tummolini, Rino Falcone, Maria Miceli, editors, The Goals of Cognition: Essays in honour of Cristiano Castelfranchi, pages 467–496. College Publications. ISBN: 978-1848900943.
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=978-184...

Research with collaborative robotic systems has much to gain by leveraging concepts and ideas from the areas of multi-agent systems and the social sciences. In this paper we propose an approach to formalizing and grounding important aspects of collaboration in a collaborative system shell for robotic systems. This is done primarily in terms of the concept of delegation, where delegation will be instantiated as a speech act. The formal characterization of the delegation speech act is based on a preformal theory of delegation proposed by Falcone and Castelfranchi. We show how the delegation speech act can in fact be used to formally ground an abstract characterization of delegation into a FIPA-compliant implementation in an agent-oriented language such as JADE, as part of a collaborative system shell for robotic systems. The collaborative system shell has been developed as a prototype and used in collaborative missions with multiple unmanned aerial vehicle systems.

2011
[10] Full text  Patrick Doherty, Fredrik Heintz and David Landén. 2011.
A Delegation-Based Architecture for Collaborative Robotics.
In Danny Weyns and Marie-Pierre Gleizes, editors, Agent-Oriented Software Engineering XI: 11th International Workshop, AOSE 2010, Toronto, Canada, May 10-11, 2010, Revised Selected Papers, pages 205–247. In series: Lecture Notes in Computer Science #6788. Springer Berlin/Heidelberg. ISBN: 978-3-642-22635-9.
DOI: 10.1007/978-3-642-22636-6_13.
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=978-3-6...
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/12509689
fulltext:postprint: http://liu.diva-portal.org/smash/get/div...

Collaborative robotic systems have much to gain by leveraging results from the area of multi-agent systems and in particular agent-oriented software engineering. Agent-oriented software engineering has much to gain by using collaborative robotic systems as a testbed. In this article, we propose and specify a formally grounded generic collaborative system shell for robotic systems and human operated ground control systems. Collaboration is formalized in terms of the concept of delegation and delegation is instantiated as a speech act. Task Specification Trees are introduced as both a formal and pragmatic characterization of tasks and tasks are recursively delegated through a delegation process implemented in the collaborative system shell. The delegation speech act is formally grounded in the implementation using Task Specification Trees, task allocation via auctions and distributed constraint problem solving. The system is implemented as a prototype on Unmanned Aerial Vehicle systems and a case study targeting emergency service applications is presented.

2009
[9] Full text  Patrick Doherty and Jonas Kvarnström. 2009.
Temporal Action Logics.
In V. Lifschitz, F. van Harmelen, and F. Porter, editors, Handbook of Knowledge Representation, pages 709–757. In series: Foundations of Artificial Intelligence #3. Elsevier. ISBN: 978-0-444-52211-5.
DOI: 10.1016/S1574-6526(07)03018-0.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q=9...

The study of frameworks and formalisms for reasoning about action and change [67, 58, 61, 65, 70, 3, 57] has been central to the knowledge representation field almost from the inception of Artificial Intelligence as a general field of research [52, 56]. The phrase “Temporal Action Logics” represents a class of logics for reasoning about action and change that evolved from Sandewall’s book on Features and Fluents [61] and owes much to this ambitious project. There are essentially three major parts to Sandewall’s work. He first developed a narrative-based logical framework for specifying agent behavior in terms of action scenarios. The logical framework is state-based and uses explicit time structures. He then developed a formal framework for assessing the correctness (soundness and completeness) of logics for reasoning about action and change relative to a set of well-defined intended conclusions, where reasoning problems were classified according to their ontological or epistemological characteristics. Finally, he proposed a number of logics defined semantically in terms of definitions of preferential entailment1 and assessed their correctness using his assessment framework.

2004
[8] Full text  Patrick Doherty, Jaroslaw Kachniarz and Andrzej Szalas. 2004.
Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases.
In Andrzej Skowron,Lech Polkowski ,Sankar K Pal, editors, Rough-Neural Computing: Techniques for Computing with Words, pages 219–250. In series: Cognitive Technologies #??. Springer. ISBN: 9783540430599.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/14144444
find book in another country/hitta boken i ett annat land: http://www.worldcat.org/title/rough-neur...

Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.

[7] Full text  Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron and Andrzej Szalas. 2004.
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge.
In Andrzej Skowron,Lech Polkowski ,Sankar K Pal, editors, Rough-Neural Computing: Techniques for Computing with Words, pages 189–218. In series: Cognitive Technologies #??. Springer. ISBN: 9783540430599, 3540430598.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/14144444
find book in another country/hitta boken i ett annat land: http://www.worldcat.org/search?qt=worldc...

Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.

2002
[6] John-Jules Meyer and Patrick Doherty. 2002.
Preferential Action Semantics.
In John-Jules Ch Meyer; Jan Treur, editor, Handbook of Defeasible Reasoning and Uncertainty Management Systems: Volume 7:: Agent-Based Defeasible Control in Dynamic Environments. In series: Handbook of Defeasible Reasoning and Uncertainty Management Systems #7. Kluwer. ISBN: 978-1-4020-0834-4, 14-02-0-0834-1.
find book in another country/hitta boken i ett annat land: http://www.worldcat.org/search?q=Handboo...

This last volume of the Handbook of Defeasible Reasoning and Uncertainty Management Systems is - together with Volume 6 - devoted to the topics Reasoning and Dynamics, covering both the topics of \"Dynamics of Reasoning,\" where reasoning is viewed as a process, and \"Reasoning about Dynamics,\" which must be understood as pertaining to how both designers of, and agents within dynamic systems may reason about these systems. The present volume presents work done in this context and is more focused on \"reasoning about dynamics,\" viz. how (human and artificial) agents reason about (systems in) dynamic environments in order to control them. In particular modelling frameworks and generic agent models for modelling these dynamic systems and formal approaches to these systems such as logics for agents and formal means to reason about agent-based and compositional systems, and action &amp; change more in general are considered.

1996
[5] Patrick Doherty and Witold Lukaszewicz. 1996.
A study in modal embeddings of NML3.
In Patrick Doherty, editor, Partiality, Modality, and Nonmonotonicity, Studies in Logic, Language and Information., pages 145–168. CSLI Publications. ISBN: 1-57586-031-7, 1-57586-030-9.

1994
[4] Patrick Doherty and Witold Lukaszewicz. 1994.
Circumscribing features and fluents.
In Dov M. Gabbay and Hans Jürgen Ohlbach, editors, Temporal Logic: First International Conference, ICTL'94 Bonn, Germany, July 11–14, 1994 Proceedings, pages 82–100. In series: Lecture Notes in Computer Science #827. Springer Berlin/Heidelberg. ISBN: 354058241X, 038758241X.
DOI: 10.1007/BFb0013982.

Sandewall has recently proposed a systematic approach to the representation of knowledge about dynamical systems that includes a general framework in which to assess the range of applicability of existing and new logics for action and change and to provide a means of studying whether and in what sense the logics of action and change are relevant for intelligent agents. As part of the framework, a number of logics of preferential entailment are introduced and assessed for particular classes of action scenario descriptions. This paper provides syntactic characterizations of several of these relations of preferential entailment in terms of standard FOPC and circumscription axioms. The intent is to simplify the process of comparison with existing formalisms which use more traditional techniques and to provide a basis for studying the feasibility of compiling particular classes of problems into logic programs.

1993
[3] Patrick Doherty and Dimiter Driankov. 1993.
Nonmonotonicity, fuzziness, and multi-values.
In R. Lowen and M. Roubens, editors, Fuzzy Logic: State of the Art. Series D: System Theory, Knowledge Engineering and Problem Solving.. In series: Volume 12 #12. Kluwer Academic Publishers. ISBN: 0792323246, 9780792323242.

1992
[2] Patrick Doherty and Witold Lukaszewicz. 1992.
Distinguishing between facts and default assumptions.
In W. van der Hoek, editor, Non-Monotonic Reasoning and Partial Semantics. Ellis Horwood Workshops.. Ellis Horwood Ltd.. ISBN: 0136251463, 9780136251460.

[1] Dimiter Driankov and Patrick Doherty. 1992.
A non-monotonic fuzzy logic.
In Lotfi A. Zadeh, Janusz Kacprzyk, editors, Fuzzy Logic for the Management of Uncertainty, pages 171–190. John Wiley & Sons. ISBN: 0-471-54799-9.