Filters








642 Hits in 2.4 sec

Abduction, ASP and Open Logic Programs [article]

Piero A. Bonatti
2002 arXiv   pre-print
Open logic programs and open entailment have been recently proposed as an abstract framework for the verification of incomplete specifications based upon normal logic programs and the stable model semantics  ...  In some cases, we will be able to reduce open inference to abduction and ASP, thereby estimating its computational complexity.  ...  Acknowledgements The author is grateful to the anonymous referees for their comments, that led to significant improvements in the paper.  ... 
arXiv:cs/0207021v1 fatcat:rusnjdhuwrhl7licozbhxw3xhe

MoDiSo: A TOOL FOR BUILDING CONTRACT DISPUTE RESOLUTION SYSTEMS

NGUYEN DUY HUNG, PHAN MINH THANG, PHAN MINH DUNG
2012 International journal on artificial intelligence tools  
Hence in order to build contract dispute resolution systems we need a tool capable of representing, reasoning and programming with contract laws.  ...  of law, to propose: first, a modular architecture for contract dispute resolution systems with an edit-compile-dispute loop facilitating incremental system developments; and second, a methodology to represent  ...  14 such as the credulous semantics and the sceptical preferred semantics.  ... 
doi:10.1142/s0218213012500029 fatcat:p2i7bflombfsdfdmfcpvxkppqe

Can Paraconsistency Replace Non-Monotonicity?

Luis Estrada-González, Claudia Olmedo-García
2009 Latin-American Workshop on Non-Monotonic Reasoning  
the latter were created for, namely updating of databases by increment of information.  ...  As originally put forward they might seem too colorful or unserious and easily dismissible, but they really call into question the foundations of non-monotonic logic.  ...  We would like to thank Juan Francisco Orea-Retif and two anonymous referees for many useful comments and suggestions.  ... 
dblp:conf/lanmr/Estrada-GonzalezO09 fatcat:2c2svgzjnjbutlrjdqqvzzsgoe

Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics [chapter]

Abdallah Arioua, Nouredine Tamani, Madalina Croitoru, Jérôme Fortin, Patrice Buche
2015 Lecture Notes in Computer Science  
As a proof of concept of the new results obtained by the proposed mapping we introduce an any-time algorithm for query answering that starts off by a small set of facts and incrementally adds to this set  ...  In this paper we propose a mapping between inconsistent ontological knowledge bases and semi-monotonic, prerequisite-free closed normal default theories.  ...  We use this link to prove the relation between AR-semantics and sceptical inference and also between the Brave-semantics and credulous inference in closed normal default theories. Theorem 3.  ... 
doi:10.1007/978-3-319-19369-4_49 fatcat:ba6klaxdxzb6nadbwsqycxmmc4

Verification, Validation and Integrity of Distributed and Interchanged Rule Based Policies and Contracts in the Semantic Web [article]

Adrian Paschke
2006 arXiv   pre-print
rule language and the system under test and thus much easier to use and understand for the rule engineer and the user.  ...  This is a serious omission, because in rule-based policy or contract representation languages rules are being used as a declarative programming language to formalize real-world decision logic and create  ...  In section 3 we define syntax and semantics of TCs and ICs for LP based policy/contract specifications.  ... 
arXiv:cs/0609119v2 fatcat:xnhe7xg3fbgvdeapdviaibig3e

Recovery of (non)monotonic theories

Cees Witteveen, Wiebe van der Hoek
1998 Artificial Intelligence  
If a classical semantics is used, it is clear that R should be a contraction.  ...  In these postulates we assume that, when recovering a theory T with respect to some intended semantics, one can fall back on a weaker, so called backup semantics for T.  ...  Acknowledgement The authors would like to thank the reviewers for their constructive comments on a previous version of this paper.  ... 
doi:10.1016/s0004-3702(98)00099-x fatcat:5m66ieypj5e5djdicijy6iudnu

Assumption-Based Argumentation for the Minimal Concession Strategy [chapter]

Maxime Morge, Paolo Mancarella
2010 Lecture Notes in Computer Science  
We claim here that the outcome of negotiations, which are guaranteed to terminate, is an optimal agreement (when possible) if the agents adopt the MC strategy.  ...  However, even if computational models of arguments are used to encompass the reasoning of interacting agents, this logical approach does not come with an effective strategy for agents engaged in negotiations  ...  Acknowledgements We would like to thank the anonymous reviewers for their detailed comments on this paper. The authors thank Phan Minh Dung for many useful discussions on the topic of this work.  ... 
doi:10.1007/978-3-642-12805-9_7 fatcat:nsdu35h5mfe5zpi2lbszssqq5y

Page 2184 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
(61-93); Donald Nute, Possible worlds without possibilia (153-167); Eros Corazza, She*: pragmat- ically imparted or semantically encoded? (217-234); William J. Ra- paport, Stuart C.  ...  models (163-174); Tadatoshi Miyamoto, A note on weak segments of PFA (175-197); Koji Nakatogawa and Takeshi Ueno, On structural inference rules for Gentzen-style natural deduction.  ... 

Foundational belief change

Abhaya C. Nayak
1994 Journal of Philosophical Logic  
I also thank Prasanta Bandyopadhyay, Jim Cain, Francis Je ry Pelletier and Ted Sider for their sugges tions and encouragement, and acknowledge the help of my friend Ramkrishnan Nambimadom in the construction  ...  anonymous referee for the Journal of Philosophical Logic for their insightful comments on earlier versions of this paper.  ...  , Credulity and ; then for all S in S E(a) ?  ... 
doi:10.1007/bf01049408 fatcat:qhngwutekrh6lcpjz54xfgjnei

Structured argumentation dynamics

Stipe Pandžić
2021 Annals of Mathematics and Artificial Intelligence  
Intuitively, undermining does not target default inference, as undercutting, or default conclusion, as rebutting, but rather attacks an argument's premise as a starting point for default reasoning.  ...  We build on default justification logic that already represents undercutting and rebutting attacks, and we add undermining attacks.  ...  Acknowledgements I am grateful to Allard Tamminga, Barteld Kooi and Rineke Verbrugge for their generous advice and valuable comments on the previous versions of this manuscript.  ... 
doi:10.1007/s10472-021-09765-z fatcat:y2lkf6ex2zhh3anecl7u7h5k5u

Abstract Interpretation in Formal Argumentation: with a Galois Connection for Abstract Dialectical Frameworks and May-Must Argumentation (First Report) [article]

Ryuta Arisaka, Takayuki Ito
2020 arXiv   pre-print
Some compromise is thus required for reasoning about a larger argumentation.  ...  its use and relevance.  ...  connection allows us to infer semantic properties of F ADF ∈ F ADF from within F MMA , for both the exact semantics and the ADF-grounded semantics (Cf.  ... 
arXiv:2007.12474v1 fatcat:ctmtakefzbe4raozx4rup47ywy

Arguing over Goals for Negotiation: Adopting an Assumption-Based Argumentation Decision Support System

Maxime Morge, Paolo Mancarella
2012 Group Decision and Negotiation  
The authors thank Phan Minh Dung and Francesca Toni for many useful discussions on the topic of this work.  ...  Efficient Decision Support Systems: Practice and Challenges âȂŞ From Current to Future / Book 1 Acknowledgments We would like to thank the anonymous reviewers for their detailed comments on this paper  ...  For simplicity, we abstract away from the real world data of these features and we present here an intuitive and illustrative scenario.  ... 
doi:10.1007/s10726-012-9324-4 fatcat:smist4ns6zbn5boolioxja2kde

Modular argumentation for modelling legal doctrines of performance relief

Phan Minh Dung, Phan Minh Thang, Nguyen Duy Hung
2009 Proceedings of the 12th International Conference on Artificial Intelligence and Law - ICAIL '09  
Legal doctrines provide principles, rules and guidelines for the court to objectively arrive at such an interpretation.  ...  The formalism is based on modular argumentation, a recently proposed extension of assumption-based argumentation for modelling contract dispute resolution.  ...  However, no contract could contain clauses for every eventuality since contract parties simply could not foresee all possible events in a dynamic world, or simply decide not to raise them during negotiations  ... 
doi:10.1145/1568234.1568249 dblp:conf/icail/DungTH09 fatcat:yuzwxcduxzglhcrs4kdeustgxa

Modular argumentation for modelling legal doctrines of performance relief

Phan Minh Dung, Phan Minh Thang, Nguyen Duy Hung
2010 Argument & Computation  
Legal doctrines provide principles, rules and guidelines for the court to objectively arrive at such an interpretation.  ...  The formalism is based on modular argumentation, a recently proposed extension of assumption-based argumentation for modelling contract dispute resolution.  ...  However, no contract could contain clauses for every eventuality since contract parties simply could not foresee all possible events in a dynamic world, or simply decide not to raise them during negotiations  ... 
doi:10.1080/19462160903564584 fatcat:425kaebm7feubha2fted4ejh4e

Arguing over Goals for Negotiation: Adopting an Assumption-Based Argumentation Decision Support System [chapter]

Maxime Morge
2011 Efficient Decision Support Systems - Practice and Challenges From Current to Future  
Thus, we give a clear semantics to the decisions. In this way, our framework suggests some decisions and provides an interactive and intelligible explanation of this choice.  ...  Section 4 outlines the implementation of our AF and its usage for service-oriented agents. Finally, section 5 discusses some related works and section 6 concludes with some directions for future work.  ...  The authors thank Phan Minh Dung and Francesca Toni for many useful discussions on the topic of this work.  ... 
doi:10.5772/19069 fatcat:swwzwna74zhqdehukqynboveve
« Previous Showing results 1 — 15 out of 642 results