liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Magnusson, Martin
Publications (10 of 16) Show all publications
Magnusson, M., Kvarnström, J. & Doherty, P. (2009). Abductive Reasoning with Filtered Circumscription. In: Proceedings of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC). Sydney: UTSePress
Open this publication in new window or tab >>Abductive Reasoning with Filtered Circumscription
2009 (English)In: Proceedings of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC), Sydney: UTSePress , 2009Conference paper, Published paper (Refereed)
Abstract [en]

For logical artificial intelligence to be truly useful,its methods must scale to problems of realistic size.An interruptible algorithm enables a logical agentto act in a timely manner to the best of its knowledge,given its reasoning so far. This seems necessaryto avoid analysis paralysis, trying to thinkof every potentiality, however unlikely, beforehand.These considerations prompt us to look for alternativereasoning mechanisms for filtered circumscription,a nonmonotonic reasoning formalism usede.g. by Temporal Action Logic and Event Calculus.We generalize Ginsberg’s circumscriptive theoremprover and describe an interruptible theoremprover based on abduction that has been used tounify planning and reasoning in a logical agent architecture.

Place, publisher, year, edition, pages
Sydney: UTSePress, 2009
National Category
Engineering and Technology Computer Sciences
Identifiers
urn:nbn:se:liu:diva-21973 (URN)978-0-9802840-7-2 (ISBN)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2018-01-13
Magnusson, M., Landén, D. & Doherty, P. (2009). Logical Agents that Plan, Execute, and Monitor Communication. In: Proceedings of the 2nd Workshop on Logic and the Simulation of Interaction and Reasoning (LSIR-2).
Open this publication in new window or tab >>Logical Agents that Plan, Execute, and Monitor Communication
2009 (English)In: Proceedings of the 2nd Workshop on Logic and the Simulation of Interaction and Reasoning (LSIR-2), 2009Conference paper, Published paper (Refereed)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-28262 (URN)
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2009-10-09
Magnusson, M. & Doherty, P. (2009). Planning Speech Acts in a Logic of Action and Change. In: Fredrik Heintz and Jonas Kvarnström (Ed.), The Swedish AI Society Workshop 2009, SAIS 2009: . Paper presented at 25th annual workshop of the Swedish Artificial Intelligence Society (SAIS 2009), 27-28 May 2009, Linköping, Sweden (pp. 39-48). Linköping University Electronic Press, Linköpings universitet
Open this publication in new window or tab >>Planning Speech Acts in a Logic of Action and Change
2009 (English)In: The Swedish AI Society Workshop 2009, SAIS 2009 / [ed] Fredrik Heintz and Jonas Kvarnström, Linköping University Electronic Press, Linköpings universitet , 2009, p. 39-48Conference paper, Published paper (Other academic)
Abstract [en]

Cooperation is a complex task that necessarily involves communication and reasoning about others’ intentions and beliefs. Multi-agent communication languages aid designers of cooperating robots through standardized speech acts, sometimes including a formal semantics. But a more direct approach would be to have the robots plan both regular and communicative actions themselves. We show how two robots with heterogeneous capabilities can autonomously decide to cooperate when faced with a task that would otherwise be impossible. Request and inform speech acts are formulated in the same first-order logic of action and change as is used for regular actions. This is made possible by treating the contents of communicative actions as quoted formulas of the same language. The robot agents then use a natural deduction theorem prover to generate cooperative plans for an example scenario by reasoning directly with the axioms of the theory.

Place, publisher, year, edition, pages
Linköping University Electronic Press, Linköpings universitet, 2009
Series
Linköping Electronic Conference Proceedings, ISSN 1650-3686, E-ISSN 1650-3740 ; 35
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-28259 (URN)
Conference
25th annual workshop of the Swedish Artificial Intelligence Society (SAIS 2009), 27-28 May 2009, Linköping, Sweden
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2018-01-25Bibliographically approved
Magnusson, M. & Doherty, P. (2008). Deductive Planning with Inductive Loops. In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR). Paper presented at KR 2008 (pp. 528-534). Menlo Park, CA, USA: AAAI Press
Open this publication in new window or tab >>Deductive Planning with Inductive Loops
2008 (English)In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), Menlo Park, CA, USA: AAAI Press , 2008, p. 528-534Conference paper, Published paper (Refereed)
Abstract [en]

Agents plan to achieve and maintain goals. Maintenance that requires continuous action excludes the representation of plans as finite sequences of actions. If there is no upper bound on the number of actions, a simple list of actions would be infinitely long. Instead, a compact representation requires some form of looping construct. We look at a specific temporally extended maintenance goal, multiple target video surveillance, and formalize it in Temporal Action Logic. The logic's representation of time as the natural numbers suggests using mathematical induction to deductively plan to satisfy temporally extended goals. Such planning makes use of a sound and useful, but incomplete, induction rule that compactly represents the solution as a recursive fixpoint formula. Two heuristic rules overcome the problem of identifying a sufficiently strong induction hypothesis and enable an automated solution to the surveillance problem that satisfies the goal indefinitely.

Place, publisher, year, edition, pages
Menlo Park, CA, USA: AAAI Press, 2008
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-44571 (URN)77114 (Local ID)978-1-57735-384-3 (ISBN)77114 (Archive number)77114 (OAI)
Conference
KR 2008
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12
Magnusson, M. & Doherty, P. (2008). Logical Agents for Language and Action. In: 4th International Artificial Intelligence and Interactive Digital Entertainment Conference AIIDE 2008,2008. Menlo Park, CA, USA: AAAI Press
Open this publication in new window or tab >>Logical Agents for Language and Action
2008 (English)In: 4th International Artificial Intelligence and Interactive Digital Entertainment Conference AIIDE 2008,2008, Menlo Park, CA, USA: AAAI Press , 2008Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Menlo Park, CA, USA: AAAI Press, 2008
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-44569 (URN)77112 (Local ID)978-1-57735-391-1 (ISBN)77112 (Archive number)77112 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12
Magnusson, M., Landén, D. & Doherty, P. (2008). Planning, Executing, and Monitoring Communication in a Logic-Based Multi-Agent System. In: ECAI 2008: . Paper presented at 18th European Conference on Artificial Intelligence (ECAI 2008), 21-25 July 2008, Patras, Greece (pp. 933-934). Amsterdam, Netherlands: IOS Press
Open this publication in new window or tab >>Planning, Executing, and Monitoring Communication in a Logic-Based Multi-Agent System
2008 (English)In: ECAI 2008, Amsterdam, Netherlands: IOS Press, 2008, p. 933-934Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Amsterdam, Netherlands: IOS Press, 2008
Series
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389 ; 178
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-44572 (URN)10.3233/978-1-58603-891-5-933 (DOI)000273903100234 ()77115 (Local ID)978-1-58603-891-5 (ISBN)77115 (Archive number)77115 (OAI)
Conference
18th European Conference on Artificial Intelligence (ECAI 2008), 21-25 July 2008, Patras, Greece
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12Bibliographically approved
Magnusson, M. & Doherty, P. (2008). Temporal Action Logic for Question Answering in an Adventure Game. In: Artificial General Intelligence, AGI 2008: . Paper presented at First Conference on Artificial General Intelligence (AGI 2008), 1-3 March 2008, Memphis, TN, USA (pp. 236-247). Amsterdam, Netherlands: IOS Press
Open this publication in new window or tab >>Temporal Action Logic for Question Answering in an Adventure Game
2008 (English)In: Artificial General Intelligence, AGI 2008, Amsterdam, Netherlands: IOS Press, 2008, p. 236-247Conference paper, Published paper (Refereed)
Abstract [en]

Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illustrate this using Our own attempts to build a practical agent architecture on it logicist foundation. In the ANDI-Land adventure game concept players solve puzzles by eliciting information from computer characters through natural language question answering. While numerous challenges immediately presented themselves, they took on a form of concrete and accessible problems to solve, and we present some of our initial solutions. We conclude that games, due to their demand for human-like computer characters with robust and independent operation in large simulated worlds, might serve as excellent test beds for research towards artificial general intelligence.

Place, publisher, year, edition, pages
Amsterdam, Netherlands: IOS Press, 2008
Series
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389 ; 15
Keywords
Temporal Action Logic; computer games; natural language understanding; artificial general intelligence; natural deduction; planning; epistemic reasoning
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-44573 (URN)000273520300020 ()77116 (Local ID)978-1-58603-833-5 (ISBN)77116 (Archive number)77116 (OAI)
Conference
First Conference on Artificial General Intelligence (AGI 2008), 1-3 March 2008, Memphis, TN, USA
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12Bibliographically approved
Magnusson, M. (2007). Deductive Planning and Composite Actions in Temporal Action Logic. (Licentiate dissertation). : Institutionen för datavetenskap
Open this publication in new window or tab >>Deductive Planning and Composite Actions in Temporal Action Logic
2007 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. We introduce a translation from a subset of Temporal Action Logic to constraint logic programs that takes advantage of these characteristics to make the logic applicable, not just as a formal specification language, but in solving practical reasoning problems. Extensions are introduced that enable the generation of action sequences, thus paving the road for interesting applications in deductive planning. The use of qualitative temporal constraints makes it possible to follow a least commitment strategy and construct partially ordered plans. Furthermore, the logical language and logic program translation is extended with the notion of composite actions that can be used to formulate and execute scripted plans with conditional actions, non-deterministic choices, and loops. The resulting planner and reasoner is integrated with a graphical user interface in our autonomous helicopter research system and applied to logistics problems. Solution plans are synthesized together with monitoring constraints that trigger the generation of recovery actions in cases of execution failures.

Place, publisher, year, edition, pages
Institutionen för datavetenskap, 2007. p. 85
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1329
Series
Keywords
Temporal Action Logic, deductive planning, composite actions, interval algebra, constraint logic programming, execution monitoring
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-9726 (URN)978-91-85895-93-9 (ISBN)
Presentation
2007-09-28, Alan Turing, Hus E, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Opponent
Supervisors
Available from: 2007-10-12 Created: 2007-10-12 Last updated: 2018-01-13
Magnusson, M. & Doherty, P. (2007). Deductive Planning with Temporal Constraints. In: Commonsense 2007, the 8th International Symposium on Logical Formalizations of Commonsense Reasoning,2007. Menlo Park, CA, USA: AAAI Press
Open this publication in new window or tab >>Deductive Planning with Temporal Constraints
2007 (English)In: Commonsense 2007, the 8th International Symposium on Logical Formalizations of Commonsense Reasoning,2007, Menlo Park, CA, USA: AAAI Press , 2007Conference paper, Published paper (Refereed)
Abstract [en]

Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction technology to facilitate such reasoning through temporal constraint networks. Extensions are introduced that make generation of action sequences possible, thus paving the road for interesting applications in deductive planning. The extended formalism is encoded as a logic program that is able to realize a least commitment strategy that generates partial order plans in the context of both qualitative and quantitative temporal constraints.

Place, publisher, year, edition, pages
Menlo Park, CA, USA: AAAI Press, 2007
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-39649 (URN)50546 (Local ID)978-1-57735-314-0 (ISBN)50546 (Archive number)50546 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-13
Doherty, P., Magnusson, M. & Szalas, A. (2006). Approximate Databases: A support tool for approximate reasoning. Journal of applied non-classical logics, 16(1-2), 87-118
Open this publication in new window or tab >>Approximate Databases: A support tool for approximate reasoning
2006 (English)In: Journal of applied non-classical logics, ISSN 1166-3081, Vol. 16, no 1-2, p. 87-118Article in journal (Refereed) Published
Abstract [en]

This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The implementation is based upon the use of a standard SQL database to store logical facts, augmented with several query interface layers implemented in JAVA through which extensional, intensional and local closed world nonmonotonic queries in the form of crisp or approximate logical formulas can be evaluated tractably. A graphical database design user interface is also provided which simplifies the design of databases, the entering of data and the construction of queries. The theory and semantics for AKDBs is presented in addition to application examples and details concerning the database implementation.

Place, publisher, year, edition, pages
Éditions Hermès-Lavoisier, 2006
Keywords
approximate reasoning, approximate databases, knowledge representation, secondorder quantifier elimination
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-31792 (URN)10.3166/jancl.16.87-117 (DOI)17616 (Local ID)17616 (Archive number)17616 (OAI)
Note
Special issue on implementation of logicsAvailable from: 2009-10-09 Created: 2009-10-09 Last updated: 2018-01-13
Organisations

Search in DiVA

Show all publications