135 results found
Kowalski R, Sadri F, Calejo M, et al., 2023, Combining Logic Programming and Imperative Programming in LPS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Pages: 210-223
Logic programs and imperative programs employ different notions of computing. Logic programs compute by proving that a goal is a logical consequence of the program, or by showing that the goal is true in a model defined by the program. Imperative programs compute by starting from an initial state, executing actions to transition from one state to the next, and terminating (if at all) in a final state when the goal is solved. In this paper, we present the language LPS (Logic Production Systems), which combines the logic programming and imperative programming notions of computing. Programs in LPS compute by using beliefs, represented by logic programs, to model the changing world, and by executing actions, to change the world, to satisfy goals, represented by reactive rules and constraints.
Broda K, Sadri F, Butler S, 2022, Reactive answer set programming, Theory and Practice of Logic Programming, Vol: 22, ISSN: 1471-0684
Logic Production System (LPS) is a logic-based framework for modelling reactive behaviour. Based on abductive logic programming, it combines reactive rules with logic programs, a database and a causal theory that specifies transitions between the states of the database. This paper proposes a systematic mapping of the Kernel of this framework (called KELPS) into an answer set program (ASP). For this purpose a new variant of KELPS with finite models, called n-distance KELPS, is introduced. A formal definition of the mapping from this n-distance KELPS to ASP is given and proven sound and complete. The Answer Set Programming paradigm allows to capture additional behaviours to the basic reactivity of KELPS, in particular proactive, preemptive and prospective behaviours. These are all discussed and illustrated with examples. Then a hybrid framework is proposed that integrates KELPS and ASP, allowing to combine the strengths of both paradigms.
Wielemaker J, Riguzzi F, Kowalski B, et al., 2019, Using SWISH to realise interactive web based tutorials for logic based languages, Theory and Practice of Logic Programming, Vol: 19, Pages: 229-261, ISSN: 1471-0684
Kowalski R, Sadri F, Calejo M, 2017, How to do it with LPS (Logic-based Production System), International Joint Conference on Rules and Reasoning 2017 (RuleML+RR 2017), ISSN: 1613-0073
LPS is a logic and computer language in which computation performs actions, to make goals true, using beliefs about what is already true.
Costantini S, Franconi E, van Woensel W, et al., 2017, Preface, ISBN: 9783319612515
Sadri F, 2016, Intelligent Cutter Suction Dredging Using the Logic Based Framework LPS, RuleML-SUP 2016, Publisher: CEUR, ISSN: 1613-0073
LPS (Logic-based Production System) is a framework that combines logic programs with reactive rules and a destructivelyupdated database. The logic programs provide proactive behavior and allow definitions of processes, and the reactive rules provide reactive behavior. This paper describes a first attempt in using LPS to model the operations of cutter suction dredging (CSD). It is the result of a year-long consultation with experts from the Dredging Engineering Research Centre at Hohai University. LPS was chosen for this application because its combination of proactivity and reactivity was thought to be a good match for CSD operations. These require processes for normal operations, as well as constant monitoring to identify any operational problems that may be arising and taking reactive correction steps.
KOWALSKI R, SADRI F, 2016, Programming in logic without logic programming, Theory and Practice of Logic Programming, Vol: 16, Pages: 269-295, ISSN: 1475-3081
In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving force, and logic programs play only a supporting role. In the canonical model, states, actions, and other events are represented with timestamps. But in the operational semantics (OS), for the sake of efficiency, timestamps are omitted and only the current state is maintained. State transitions are performed reactively by executing actions to make the consequents of rules true whenever the antecedents become true. This OS is sound, but incomplete. It cannot make reactive rules true by preventing their antecedents from becoming true, or by proactively making their consequents true before their antecedents become true. In this paper, we characterize the notion of reactive model, and prove that the OS can generate all and only such models. In order to focus on the main issues, we omit the logic programming component of the framework.
Sadri F, Kowalski R, 2015, Reactive computing as model generation, New Generation Computing: computing paradigms and computational intelligence, Vol: 33, Pages: 33-67, ISSN: 0288-3635
In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications. Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent’s goals all true. States are represented by sets of atomic sentences (or facts), representing the values of program variables, tuples in a coordination language, facts in relational databases, or Herbrand models. In the model-theoretic semantics, the entire sequence of states and events are combined into a single model-theoretic structure, by associating timestamps with facts and events. But in the operational semantics, facts are updated destructively, without timestamps. We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing timestamps. We also extend the model with intentional predicates and composite event predicates defined by logic programs containing conditions in first-order logic, which query the current state.
Bassiliades N, Gottlob G, Sadri F, et al., 2015, Rule technologies: Foundations, tools, and applications: 9th international symposium, RuleML 2015 Berlin, Germany, August 2-5, 2015 proceedings, ISSN: 0302-9743
Sadri F, Kowalski R, 2014, Completeness of a Reactive System Language, RuleML 2014
Typical reactive system languages are programmed by means of rules of the form if antecedent then consequent. However, despite their seemingly logical character, hardly any reactive system languages give such rules a logical interpretation. In this paper, we investigate a simplified reactive system language KELPS, in which rules are universally quantified material implications, and computation attempts to generate a model that makes the rules true. The operational semantics of KELPS is similar to that of other reactive system languages, and is similarly incomplete. It cannot make a rule true by making its antecedent false, or by making its consequent true whether or not its antecedent becomes true. In this paper, we characterize the reactive models, for which the operational semantics is complete. Informally speaking, a model is reactive if every action in the model is an instance of an action in the consequent of a rule whose earlier conditions are true.
Kowalski R, Sadri F, 2014, A logical characterization of a reactive system language, Pages: 22-36, ISSN: 0302-9743
Typical reactive system languages are programmed by means of rules of the form if antecedent then consequent. However, despite their seemingly logical character, hardly any reactive system languages give such rules a logical interpretation. In this paper, we investigate a simplified reactive system language KELPS, in which rules are universally quantified material implications, and computation attempts to generate a model that makes the rules true. The operational semantics of KELPS is similar to that of other reactive system languages, and is similarly incomplete. It cannot make a rule true by making its antecedent false, or by making its consequent true whether or not its antecedent becomes true. In this paper, we characterize the reactive models computed by the operational semantics. Informally speaking, a model is reactive if every action in the model is an instance of an action in the consequent of a rule whose earlier conditions are true. © 2014 Springer International Publishing.
Kakas AC, Mancarella P, Sadri F, et al., 2014, Computational Logic Foundations of KGP Agents., CoRR, Vol: abs/1401.3443
, 2013, Computational Logic in Multi-Agent Systems, Departmental Report, Publisher: Springer Berlin Heidelberg
Kowalski R, Sadri F, 2012, A logic-based framework for reactive systems, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol: 7438 LNCS, Pages: 1-15, ISSN: 0302-9743
We sketch a logic-based framework in which computation consists of performing actions to generate a sequence of states, with the purpose of making a set of reactive rules in the logical form antecedents ( consequents all true. The antecedents of the rules are conjunctions of past or present conditions and events, and the consequents of the rules are disjunctions of conjunctions of future conditions and actions. The antecedents can be viewed as complex/composite events, and the consequents as complex/composite/macro actions or processes. States are represented by sets of atomic sentences, and can be viewed as global variables, relational databases, Herbrand models, or mental representations of the real world. Events, including actions, transform one state into another. The operational semantics maintains only a single, destructively updated current state, whereas the model-theoretic semantics treats the entire sequence of states, events and actions as a single model. The model-theoretic semantics can be viewed as the problem of generating a model that makes all the reactive rules true. © 2012 Springer-Verlag.
Kowalski RA, Sadri F, 2012, Teleo-reactive abductive logic programs, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol: 7360 LNCS, Pages: 12-32, ISSN: 0302-9743
Teleo-reactive (TR) programs are a variety of production systems with a destructively updated database that represents the current state of the environment. They combine proactive behaviour, which is goal-oriented, with reactive behaviour, which is sensitive to the changing environment. They can take advantage of situations in which the environment opportunistically solves the system's goals, recover gracefully when the environment destroys solutions of its goals, and abort durative actions when higher priority goals need more urgent attention. In this paper, we present an abductive logic programming (ALP) representation of TR programs, following the example of our ALP representation of the logic-based production system language LPS. The operational semantics of the representation employs a destructively updated database, which represents the current state of the environment, and avoids the frame problem of explicitly reasoning about the persistence of facts that are not affected by the updates. The model-theoretic semantics of the representation is defined by associating a logic program with the TR program, the sequence of observations and actions, and the succession of database states. In the semantics, the task is to generate actions so that all of the program's goals are true in a minimal model of this associated logic program. © 2012 Springer-Verlag Berlin Heidelberg.
Sadri F, Wang W, Xafi A, 2012, Intention recognition with clustering, Pages: 379-384, ISSN: 0302-9743
Intention recognition has significant applications in ambient intelligence, assisted living and care of the elderly, amongst others. In this paper we explore an approach to intention recognition based on clustering. To this end we show how to map the intention recognition problem into a clustering problem. To our knowledge the use of clustering techniques for intention recognition is novel, and this paper suggests it is promising.
Sadri F, 2012, Intention Recognition in Agents for Ambient Intelligence: Logic-Based Approaches, AGENTS AND AMBIENT INTELLIGENCE: ACHIEVEMENTS AND CHALLENGES IN THE INTERSECTION OF AGENT TECHNOLOGY AND AMBIENT INTELLIGENCE, Editors: Bosse, Publisher: IOS PRESS, Pages: 197-236, ISBN: 978-1-61499-049-9
Sadri F, 2011, Ambient Intelligence: A Survey, ACM COMPUTING SURVEYS, Vol: 43, ISSN: 0360-0300
Kowalski R, Sadri F, 2011, Abductive logic programming agents with destructive databases, ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, Vol: 62, Pages: 129-158, ISSN: 1012-2443
Sadri F, 2011, Logic-Based Approaches to Intention Recognition, HANDBOOK OF RESEARCH ON AMBIENT INTELLIGENCE AND SMART ENVIRONMENTS: TRENDS AND PERSPECTIVES, Publisher: IGI GLOBAL, Pages: 346-375, ISBN: 978-1-61692-857-5
Sadri F, 2011, INTENTION RECOGNITION WITH EVENT CALCULUS GRAPHS AND WEIGHT OF EVIDENCE, ICAART 2011: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, Pages: 470-475
Sadri F, 2010, Intention recognition with event calculus graphs, Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010, Pages: 386-391
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detection. In this paper we propose an intention recognition system based on the event calculus. The system, called WIREC, exploits profiles, contextual information, heuristics and any available integrity constraints together with plan libraries and a basic theory of actions, causality and ramifications. Whenever the profile and context suggest there is a usual pattern of behaviour on the part of the actor the search for intention can be focused on existing plan libraries. On the other hand, when no such information is available or if the behaviour of the actor deviates from the usual pattern the search for intention can revert to the basic theory of actions, in effect dynamically constructing partial plans corresponding to the actions executed by the actor. © 2010 IEEE.
Sadri F, Stathis K, 2010, Special Issue on Artificial Societies for Ambient Intelligence Editorial Introduction, COMPUTER JOURNAL, Vol: 53, Pages: 1136-1137, ISSN: 0010-4620
Kowalski R, Sadri F, 2010, An Agent Language with Destructive Assignment and Model-Theoretic Semantics, 11th International Workshop on Computational Logic in Multi-Agent Systems, Publisher: SPRINGER-VERLAG BERLIN, Pages: 200-218, ISSN: 0302-9743
Mancarella P, Terreni G, Sadri F, et al., 2009, The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments, THEORY AND PRACTICE OF LOGIC PROGRAMMING, Vol: 9, Pages: 691-750, ISSN: 1471-0684
Mancarella P, Terreni G, Sadri F, et al., 2009, The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments., Theory Pract. Log. Program., Vol: 9, Pages: 691-750
Kowalski R, Sadri F, 2009, Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents, 3rd International Conference on Web Reasoning and Rule Systems, Publisher: SPRINGER-VERLAG BERLIN, Pages: 1-23, ISSN: 0302-9743
Kakas A, Mancarella P, Sadri F, et al., 2008, Computational Logic Foundations of KGP Agents, JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, Vol: 33, Pages: 285-348, ISSN: 1076-9757
Belardinelli F, Lomuscio A, 2008, A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems, 8th International Workshop on Computational Logic in Multi-Agent Systems, Publisher: SPRINGER-VERLAG BERLIN, Pages: 248-+, ISSN: 0302-9743
Sadri F, 2008, Multi-Agent Ambient Intelligence for Elderly Care and Assistance, International Electronic Conference on Computer Science, Publisher: AMER INST PHYSICS, Pages: 117-120, ISSN: 0094-243X
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.