Filters








29,519 Hits in 7.3 sec

A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption [chapter]

Umberto Straccia
2007 Lecture Notes in Computer Science  
The Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA).  ...  Besides being the procedure novel for the AWA, we get for free a novel top-down query procedure for many-valued normal logic programs.  ...  Introduction The Any-World Assumption (AWA) for normal logic programs [16] is a generalization of the notions of the Closed World Assumption (CWA) (which asserts that by default the truth of an atom  ... 
doi:10.1007/978-3-540-75256-1_13 fatcat:gkl7pdxpivdy7lmoocrmfdl6ta

Recent Advances in Querying Probabilistic Knowledge Bases

Stefan Borgwardt, İsmail İlkan Ceylan, Thomas Lukasiewicz
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
We concentrate especially on increasing the semantic expressivity of formalisms for representing and querying probabilistic knowledge (i) by giving up the closed-world assumption, (ii) by allowing for  ...  commonsense knowledge (and in parallel giving up the tuple-independence assumption), and (iii) by giving up the closed-domain assumption, while preserving some computational properties of query answering  ...  Acknowledgments This work was supported by the German Research Foundation (DFG) within the project BA 1122/19-1 (GOASQ), by The Alan Turing Institute under the UK EPSRC grant EP/N510129/1, and by the EPSRC  ... 
doi:10.24963/ijcai.2018/765 dblp:conf/ijcai/BorgwardtCL18 fatcat:o43b3gn6sbgydncx55ryiqftde

DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover [chapter]

Chandrabose Aravindan
1996 Lecture Notes in Computer Science  
In particular, restart model elimination calculus is answer complete for postive queries.  ...  The DisLoP project started at this point with the aim of extending this further to minimal model reasoning and query processing wrt normal disjunctive logic programming too.  ...  This project on disjunctive logic programming is sponsored by DFG under the grant number Fu 263/3-1.  ... 
doi:10.1007/3-540-61708-6_42 fatcat:slgggh7mwfgpjoc7rwt3rnrcqy

On Negative Information in Deductive Databases

Marek A. Suchenek, Rajshekhar Sunderraman
1990 Journal of Database Management  
X 1 and X for Y 1 Modified query clause: ← component(P 7 , X) Program clause: component(P 7 , P 9 ) ← Unification substitution: P 9 for X Modified query clause: 2 Answer to query: X = P 9 4.  ...  clause: 2 Answer to query: X = P 8 Query clause: Unification substitution: P 4 for X 1 and X for Y 1 Modified query clause: ← component(P 4 , Z 1 ), sub − component(Z 1 , X) Program clause: component(P  ...  The clause ¬SU P P LIES(S 1 , P 3 ) follows from this database under the closed world assumption.  ... 
doi:10.4018/jdm.1990070103 fatcat:zlobe4zujzbj3iihylks2hkfxq

Rules with Contextually Scoped Negation [chapter]

Axel Polleres, Cristina Feier, Andreas Harth
2006 Lecture Notes in Computer Science  
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism.  ...  Especially negation as failure, which intuitively adopts a closed world view, is often claimed to be unsuitable for the Web where knowledge is notoriously incomplete.  ...  Acknowledgments The authors thank Jos de Bruijn, Rubén Lara, and Michael Kifer for fruitful discussions and the anonymous reviewers for their useful feedback.  ... 
doi:10.1007/11762256_26 fatcat:cu7jeceu5zd2vbu7ho24cxn5aa

Evaluating epistemic negation in answer set programming

Yi-Dong Shen, Thomas Eiter
2016 Artificial Intelligence  
For example, consider a logic program = {p ← Kp}. The rule expresses that for any collection A of answer sets of and any I ∈ A, if p is true in all answer sets in A, then p is true in I .  ...  A is defined to be a world view of if it coincides with the collection of answer sets of the nested logic program A under the semantics of Lifschitz et al. [22] .  ...  Acknowledgements We would like to thank the reviewers for their thoughtful and constructive comments to improve this article.  ... 
doi:10.1016/j.artint.2016.04.004 fatcat:rnuly7e3g5b2vlcdm545olzqc4

On extended disjunctive logic programs [chapter]

Jack Minker, Carolina Ruiz
1993 Lecture Notes in Computer Science  
General techniques are described for extending the model, xpoint, and proof theories of an arbitrary semantics of normal disjunctive logic programs to cover the class of extended programs.  ...  Logic programming, as an approach to the use of logic in knowledge representation and reasoning, has gone through di erent stages. First, logic programs containing only Horn clauses were considered.  ...  Therefore any semantics de ned for the class of normal disjunctive logic programs is also a semantics for the class of normal logic programs.  ... 
doi:10.1007/3-540-56804-2_1 fatcat:jfhdlil7mbfhxjvn3zcxmimjxy

The PITA system: Tabling and answer subsumption for reasoning under uncertainty

FABRIZIO RIGUZZI, TERRANCE SWIFT
2011 Theory and Practice of Logic Programming  
As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate.  ...  AbstractMany real world domains require the representation of a measure of uncertainty.  ...  The work of the first author has been partially supported by the Camera di Commercio, Industria, Artigianato e Agricoltura di Ferrara, under the project titled "Image Processing and Artificial Vision for  ... 
doi:10.1017/s147106841100010x fatcat:uwvoqd7vpnbdhanhy53mqfj5cq

Forthcoming Papers

2004 Artificial Intelligence  
Revision by comparison Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or "corpora" of data and beliefs.  ...  We provide two kinds of semantics for this idea, give a logical characterization of the new model, study its relation with other operations of belief revision and contraction, and discuss its intuitive  ...  An important result is that (under very weak assumptions) query entailment from merged bases is "only" at the first level of the polynomial hierarchy when any of the DA 2 operators is used.  ... 
doi:10.1016/s0004-3702(04)00071-2 fatcat:tsabu6qxyvgvfcpkjzrkexxj3u

Page 5107 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
A resolution-based proof procedure, called SLI resolution, for computing answers to queries in disjunctive logic programming is considered in Chapter 4.  ...  The first concept is based on the generalized closed world assumption (GCWA): a given program P and ground atom A negation —A is true if A is not in any minimal Herbrand model of P.  ... 

Reasoning with Rules and Ontologies [chapter]

Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits
2006 Lecture Notes in Computer Science  
In this paper, after giving a brief overview about the current state of the Semantic-Web stack and its components, we will discuss nonmonotonic logic programs under the answer-set semantics as a possible  ...  We will then focus on description-logic programs (or dl-programs, for short), which realize a transparent integration of rules and ontologies supported by existing reasoning engines, based on the answer-set  ...  ) and, in the second step, the negated logic-programming predicates under the closed-world assumption (CWA).  ... 
doi:10.1007/11837787_4 fatcat:mihezlblwrhopbwjc6dhfelghi

Logic programming and knowledge representation—The A-Prolog perspective

Michael Gelfond, Nicola Leone
2002 Artificial Intelligence  
The intention is to help the reader to develop a 'feel' for the field's history and some of its recent developments. The discussion is mainly limited to logic programs under the answer set semantics.  ...  PII: S 0 0 0 4 -3 7 0 2 ( 0 2 ) 0 0 2 0 7 -2 The A-Prolog language We start with a description of syntax and semantics of A-Prolog (also called Answer Set Programming [81])-a logic programming language  ...  Acknowledgements The authors are grateful to Georg Gottlob for his contribution on complexity issues.  ... 
doi:10.1016/s0004-3702(02)00207-2 fatcat:3s6q45zj5zab5bp2ce36igl66q

About Epistemic Negation and World Views in Epistemic Logic Programs

STEFANIA COSTANTINI
2019 Theory and Practice of Logic Programming  
AbstractIn this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with " epistemic operators" and " epistemic negation", and a recent approach to the semantics of such  ...  We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.  ...  Introduction Answer Set Programming (ASP) is a successful logic programming paradigm under the answer set semantics (AS) (Gelfond and Lifschitz 1988; .  ... 
doi:10.1017/s147106841900019x fatcat:ioitt7pm2nawfcnuajiwpc4lvu

Page 9254 of Mathematical Reviews Vol. , Issue 2002M [page]

2002 Mathematical Reviews  
normal logic program WY“, so that well-known semantics and inference methods for normal logic programs can be used for hypothetical reasoning as well.”  ...  and subsumption, and 9“ speci- fies non-monotonic inference rules like closed-world-assumptions.  ... 

Semantic Web Logic Programming Tools [chapter]

Jóse Júlio Alferes, Carlos Viegas Damásio, Luís Moniz Pereira
2003 Lecture Notes in Computer Science  
The last two decades of research in Logic Programming, both at the theoretical and practical levels, have addressed several topics highly relevant for the Semantic Web effort, providing very concrete answers  ...  The paper does not intended to be a survey of logic programming techniques applicable to the Semantic Web, and so the interested reader should try to obtain the missing information in the logic programming  ...  Part of the work on logic programming updates has been supported by projects FLUX "Flexible Logical Updates" (POSI/SRI/40958/2001) , funded by FEDER, and TARDE "Tabulation and Reasoning in a Distributed  ... 
doi:10.1007/978-3-540-24572-8_2 fatcat:fcn3m4zgxfa6lil3yyygvkbu7e
« Previous Showing results 1 — 15 out of 29,519 results