573 Hits in 6.4 sec

Knowledge representation with logic programs [chapter]

Gerhard Brewka, Jürgen Dix
1998 Lecture Notes in Computer Science  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Fuchs, Ulrich Furbach, Ilkka Niemelä and Chiaki Sakama who provided us with many useful remarks. Katrin Erk and Dorothea Schäfer proofread parts of the paper-special thanks to them.  ...  totally prioritized logic program and let ¢ be an answer set of ¥ . ¢ is a preferred answer set of if and only if for each rule We simply require that default negated preconditions be neglected, i.e.  ... 
doi:10.1007/bfb0054788 fatcat:5fa5wrvqgnco5kdgef2zcsrysm

Addressing the Qualification Problem in FLUX [chapter]

Yves Martin, Michael Thielscher
2001 Lecture Notes in Computer Science  
Our system allows to plan under the default assumption that actions succeed as they normally do, and to reason about these assumptions in order to recover from unexpected action failures.  ...  We present a logic programming method to cope with the Qualification Problem in the action programming language Flux, which builds on the Fluent Calculus as a solution to the fundamental Frame Problem.  ...  Selection of the Preferred Extension Extensions are constructed in accordance with the underlying set-prioritized default logic, which is an extension of the prioritized default logic and can be used to  ... 
doi:10.1007/3-540-45422-5_21 fatcat:b5sujznm4vdkbobmzoel3qeuim

Page 5012 of Mathematical Reviews Vol. , Issue 2001G [page]

2001 Mathematical Reviews  
) extension of the intermediate logic of “here-and-there”.  ...  Furthermore, the authors demonstrate that various forms of commonsense reason- ing in artificial intelligence, such as abduction, default reasoning, circumscription, and their prioritized versions, are  ... 

Using methods of declarative logic programming for intelligent information agents

2002 Theory and Practice of Logic Programming  
We discuss advantages and drawbacks, and point out the possible extensions and open issues.  ...  In this paper, our interest lies in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents.  ...  This work was partially supported by the Austrian Science Fund (FWF) under grants P13871-INF, P14781-INF, and Z29-INF.  ... 
doi:10.1017/s1471068402001576 fatcat:zy4b2jbtnje6righqsq4l2s324

Using Methods of Declarative Logic Programming for Intelligent Information Agents [article]

T. Eiter, M. Fink, G. Sabbatini, H. Tompits
2001 arXiv   pre-print
We discuss advantages and drawbacks, and point out possible extensions and open issues.  ...  In this paper, our interest is in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents.  ...  This work was partially supported by the Austrian Science Fund (FWF) under grants P13871-INF, P14781-INF, and Z29-INF.  ... 
arXiv:cs/0108008v1 fatcat:tg6xs5g2qfhypinc7rvjv2v2t4

Page 1258 of Mathematical Reviews Vol. , Issue 2001B [page]

2001 Mathematical Reviews  
Schaub], Query-answering in prioritized default logic (32-42); Boutheina Ben Yaghlane and Khaled Mel- louli, Updating directed belief networks (43-54); Philippe Besnard and Marie-Odile Cordier, Inferring  ...  Andre de Waal and Marc Denecker, Detecting unsolvable queries for definite logic programs (35 pp. (electronic)); Delia Kesner and Pablo E.  ... 

Logic and Databases: Past, Present, and Future

Jack Minker
1997 The AI Magazine  
Gallaire, Minker, and Nicolas stated that logic and databases was a field in its own right. This was the first time that this designation was made.  ...  The impetus for it started approximately 20 years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France.  ...  Acknowledgments This article is a condensation, and in some cases an expansion, of an invited keynote address presented at the Workshop on Logic in Databases in San Miniato, Italy, in 1996.  ... 
doi:10.1609/aimag.v18i3.1304 dblp:journals/aim/Minker97 fatcat:6foa4j2a45cabojbsyxj7rwpfq

Autonomous Hypothetical Reasoning: the Case for Open-minded Agents [chapter]

Aspassia Daskalopulu, Georgios K.
2010 Web Intelligence and Intelligent Agents  
The proposed logic is firstorder logic enhanced with special notation for the representation of Reiter's original default rules and for the derivation of extensions.  ...  D2 1,1 or D2 1,2 or D2 1,3 ) there is no need for some kind of prioritization among these defaults.  ...  This book presents a unique and diversified collection of research work ranging from controlling the activities in virtual world to optimization of productivity in games, from collaborative recommendations  ... 
doi:10.5772/8367 fatcat:uansvt6yfrftfcglqprzhhonla

Page 8151 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
] and Norman Foo, Interpolation properties of action logic: lazy-formalization to the frame problem (357-368); Tran Cao Son and Enrico Pontelli, Reasoning about actions in prioritized default theory (369  ...  Bonatti, Towards service descrip- tion logics (74-85); Rosalba Giugno and Thomas Lukasiewicz, P-S HOE (D): a probabilistic extension of “%#O@(D) for proba- bilistic ontologies in the semantic web (86-97  ... 

A Complete Declarative Debugger for Maude [chapter]

Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet
2011 Lecture Notes in Computer Science  
We present a declarative debugger for Maude specifications that allows to debug wrong answers (a wrong result is obtained) and missing answers (a correct but incomplete result is obtained) due to both  ...  wrong and missing statements and wrong search conditions.  ...  The answer in this case is transmitted with (N : ANSWER), where N is the number of the question and ANSWER the answer the user would give in the divide and query strategy.  ... 
doi:10.1007/978-3-642-17796-5_14 fatcat:z3jlwhq36zawldjnabnlml2ltq

Controlled Natural Languages for Knowledge Representation and Reasoning

Tiantian Gao, Marc Herbstritt
2016 International Conference on Logic Programming  
Although a number of machine-oriented CNLs emerged and have been used in many application domains for problem solving and question answering, there are still many limitations: First, CNLs cannot handle  ...  In this paper, it mainly focuses on a class of CNLs, called machine-oriented CNLs, which have well-defined semantics that can be deterministically translated into formal languages to do logical reasoning  ...  It is a unifying defeasible reasoning framework that uses defaults and exceptions with prioritized rules, and argumentation theories.  ... 
doi:10.4230/oasics.iclp.2016.19 dblp:conf/iclp/Gao16 fatcat:xy4yevuubzbwhaw2uwvbt5vaz4

ContractLog: An Approach to Rule Based Monitoring and Execution of Service Level Agreements [chapter]

Adrian Paschke, Martin Bichler, Jens Dietrich
2005 Lecture Notes in Computer Science  
In this paper we evolve a rule based approach to SLA representation and management which allows separating the contractual business logic from the application logic and enables automated execution and  ...  We make use of a set of knowledge representation (KR) concepts and combine adequate logical formalisms in one expressive formal framework called ContractLog.  ...  a class and instance mapping 4 [7] to answer typical DL queries (RDFS and OWL Lite/DL inference) such as class-instance membership queries, class subsumption queries, class hierarchy queries etc.  ... 
doi:10.1007/11580072_19 fatcat:crdbgzxrkbegzhqcjnkwjizc4q

Knowledge representation concepts for automated SLA management

Adrian Paschke, Martin Bichler
2008 Decision Support Systems  
The complexity of contractual logic in SLAs requires new forms of knowledge representation to automatically draw inferences and execute contractual agreements.  ...  We suggest logical formalisms for the representation and enforcement of SLA rules and describe a proof-of-concept implementation.  ...  Accordingly, the answer here is X=1. The second query has the scope and the answer is X=2.  ... 
doi:10.1016/j.dss.2008.06.008 fatcat:nac3iyeilnezfkxf4vhr72qdju

Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory

Tran Cao Son, Enrico Pontelli
2004 Computational intelligence  
This extension provides a natural framework to introduce different types of preferences in action theories-preferences between actions and preferences between final states.  ...  In particular, we demonstrate how these preferences can be expressed within extended prioritized default theory.  ...  Gelfond and M. Balduccini for the comments on various drafts of this work, and the anonymous referees for their helpful comments.  ... 
doi:10.1111/j.0824-7935.2004.00242.x fatcat:c3nd6u6slffvtghcwlgbyit67m

A non-monotonic Description Logic for reasoning about typicality

L. Giordano, V. Gliozzi, N. Olivetti, G.L. Pozzato
2013 Artificial Intelligence  
In this paper we propose a non-monotonic extension of the Description Logic ALC for reasoning about prototypical properties and inheritance with exceptions.  ...  We also present a tableau calculus for deciding ALC + T min entailment that allows to give a complexity upper bound for the logic, namely that query entailment is in co-NExp NP .  ...  We also want to thank Piero Bonatti for his helpful comments and his stimulating suggestions.  ... 
doi:10.1016/j.artint.2012.10.004 fatcat:kku7kju3wrcx7kptvnoiiztp2u
« Previous Showing results 1 — 15 out of 573 results