895 Hits in 3.0 sec

CWA Extensions to Multi-Valued Logics

Jinzhao Wu
2003 Journal of Applied Non-Classical Logics  
doi:10.3166/jancl.13.133-164 fatcat:cuaosu3atngxlorlkxq62v6wzm

Fuzzy Conformance Checking of Observed Behaviour with Expectations [chapter]

Stefano Bragaglia, Federico Chesani, Paola Mello, Marco Montali, Davide Sottara
2011 Lecture Notes in Computer Science  
To this end, we present a system based on a fuzzy extension of Drools, and exploit it to perform conformance tests.  ...  Research areas like Multi Agent Systems, Business Process, and Legal/Normative systems, have proposed different characterizations of the same problem, named as the conformance problem.  ...  Such values represent the truth degree of the statement under the OWA and the CWA hypotheses: consequently, we must resort, on a domain-basis, to the OWA semantics (lower bound), or to the CWA semantics  ... 
doi:10.1007/978-3-642-23954-0_10 fatcat:o4fw4qood5fxnb5m2y35rcqnjm

Geo-Ontology and Geographical Information System Extended by a first-order logic language: Application to malaria control

Guillaume Koum
2012 International Journal on Bioinformatics & Biosciences  
With respect to the added intelligence; knowledge is preserved and enhanced. Knowledge enhancement is performed under the CWA in a subset of the first-order logic language.  ...  A geo-ontology can be built around a Geographic Information System (GIS) and enriched with a firstorder logic language under the closed-world assumption (CWA).  ...  Under the CWA, the answer to this question is negative. Geo predicate is what introduce the geo-ontology within the first-order logic framework.  ... 
doi:10.5121/ijbb.2012.2301 fatcat:avxbbeaabfam7mudhnxquko4ui

Comparative Evaluation of Approaches to Propositionalization [chapter]

Mark-A. Krogel, Simon Rawles, Filip Železný, Peter A. Flach, Nada Lavrač, Stefan Wrobel
2003 Lecture Notes in Computer Science  
In this paper, we compare up-to-date methods for propositionalization from two main groups: logic-oriented and databaseoriented techniques.  ...  Propositionalization has already been shown to be a promising approach for robustly and effectively handling relational data sets for knowledge discovery.  ...  Part of the work was done during a visit of the second author to the Czech Technical University in Prague, funded by an EC MIRACLE grant (contract ICA1-CT-2000-70002).  ... 
doi:10.1007/978-3-540-39917-9_14 fatcat:xmpef45unzb4jcvy5ssxkxgfna

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Yann Loyer, Umberto Straccia
2008 Annals of Mathematics and Artificial Intelligence  
In this work, we consider normal logic programs over complete lattices, where computable truth combination functions may appear in the rule bodies to manipulate truth values and we will provide a top-down  ...  The management of imprecise information in logic programs becomes important whenever the real world information to be represented is of an imperfect nature and the classical crisp true, false approximation  ...  Acknowledgements We would like to thank to the anonymous reviewers of our earlier version, who pointed out to related work we were not aware of.  ... 
doi:10.1007/s10472-008-9099-0 fatcat:k7j7rf5hqne4jhn2uo427cvyea


Norbert Fuhr, Norbert Gövert, Thomas Rölleke
1998 Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '98  
Based on a probabilistic four-valued logic, POOL uses an implicit open world assumption, allows for closed world assumptions and is able to deal with inconsistent knowledge.  ...  We describe the design and implementation of a system for logic-based multimedia retrieval.  ...  In [Fuhr & Rölleke 98 ], we describe the extension of probabilistic Datalog to a probabilistic four-valued logic. Let us first consider deterministic four-valued Datalog (4D).  ... 
doi:10.1145/290941.291005 dblp:conf/sigir/FuhrGR98 fatcat:geg4kpqmw5eaje3xf2am25535u

Answer Set Programming's Contributions to Classical Logic [chapter]

Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice Bruynooghe
2011 Lecture Notes in Computer Science  
to the classical setting.  ...  In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of classical logic that they exposed and investigate how the ASP approaches can be transferred back  ...  An ordered epistemic theory T over vocabulary Σ is a finite set of multi-modal logic theories over Σ that satisfies the following conditions: -Each T ∈ T is a multi-modal logic theory, possibly using modal  ... 
doi:10.1007/978-3-642-20832-4_2 fatcat:yrydik5mlrgmxd7azmhpuudz7i

The Approximate Well-Founded Semantics for Logic Programs with Uncertainty [chapter]

Yann Loyer, Umberto Straccia
2003 Lecture Notes in Computer Science  
We show that, dealing with uncertain and incomplete knowledge, atoms should be assigned only approximations of uncertainty values, unless some assumption is used to complete the knowledge.  ...  The management of uncertain information in logic programs becomes to be important whenever the real world information to be represented is of imperfect nature and the classical crisp true, false approximation  ...  Main features of our extension are (i) dealing with uncertain and incomplete knowledge, atoms are assigned approximation of uncertainty values; (ii) the CWA is used to complete the knowledge in order to  ... 
doi:10.1007/978-3-540-45138-9_48 fatcat:nvmngthssfc7jgfdn3ladslope

Homotopical inverse diagrams in categories with attributes [article]

Chris Kapulkin, Peter LeFanu Lumsdaine
2020 arXiv   pre-print
structure (Π-types, identity types, and so on) lifts from C to C^I.  ...  with attributes C and an ordered homotopical inverse category I, we construct the category with attributes C^I of homotopical diagrams of shape I in C and Reedy types over these; and we show how various logical  ...  The second-named author would also like to thank the members of the Stockholm Logic Seminar -especially Erik Palmgren, Per Martin-Löf, Chaitanya Leena Subramaniam, and Håkon Gylterud -for many useful comments  ... 
arXiv:1808.01816v3 fatcat:rty2axrfhbewbegdoskqwistna

Group decision making and Quality-of-Information in e-Health systems

L. Lima, P. Novais, R. Costa, J. Bulas Cruz, J. Neves
2010 Logic Journal of the IGPL  
It is under this framework that a Multi-valued Extended Logic Programming language will be used for knowledge representation and reasoning, leading to a model that embodies the Quality-of-Information (  ...  In this way it is possible to provide a measure of the value of the QoI that supports the decision itself.  ...  We use a similar type of knowledge representation, but we extended their approach to consider multi-valued non-monotonic logics in the formalized versions of medical guidelines.  ... 
doi:10.1093/jigpal/jzq029 fatcat:dzj2u2z72vgbjpdatlmmcov2ra


2007 Advances in Complex Systems  
Real value assignments to variables are also considered as possible state property descriptions.  ...  Temporal Development Methods for Agent-Based Systems, Journal of Autonomous Agents and Multi-Agent Systems, vol. 10, pp. 41-66. 8. Galton, A. (2003). Temporal Logic.  ... 
doi:10.1142/s021952590700115x fatcat:74jjfxybiff53f5pgkz63xks5a

A Process Model for Group Decision Making with Quality Evaluation [chapter]

Luís Lima, Paulo Novais, José Bulas Cruz
2009 Lecture Notes in Computer Science  
A Multi-valued Extended Logic Programming language is used for imperfect information representation and reasoning.  ...  Reasoning with incomplete and uncertain knowledge has to be dealt with in this kind of environment, due to the particular nature of the healthcare services, where the awful consequences of bad decisions  ...  It is now possible to measure the QK that occurs as a result of a logic program, by posting the V i (x) values into a multi-dimensional space and projecting it onto a two dimensional one, as we see in  ... 
doi:10.1007/978-3-642-02481-8_82 fatcat:h7j53szqsbdfhkozzhimtmudo4

Chapter 6 Nonmonotonic Reasoning [chapter]

Gerhard Brewka, Ilkka Niemelä, Mirosław Truszczyński
2008 Foundations of Artificial Intelligence  
Acknowledgments We would like to thank Vladimir Lifschitz and Hudson Turner for helpful comments and suggestions.  ...  If (D CWA , W ) has a unique consistent extension, then CWA(W ) is consistent and Cn(CWA(W )) is this unique extension of (D CWA , W ).  ...  If CWA(W ) is consistent, then Cn(CWA(W )) is the unique extension of the default theory (D CWA , W ).  ... 
doi:10.1016/s1574-6526(07)03006-4 fatcat:7r4l7tqgn5hfjok7yqbuxj5xwa

Page 6440 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
The extension, called collective argumentation, turns out to be suitable for representing semantics of disjunctive logic programs.  ...  Collective argumentation theories are shown to possess a four-valued semantics, and are closely re- lated to multiple-conclusion (Scott) consequence relations.  ... 

Extended Well-Founded Semantics In Bilattices

Daniel Stamate
2007 Zenodo  
One of the most used assumptions in logic programming and deductive databases is the so-called Closed World Assumption (CWA), according to which the atoms that cannot be inferred from the programs are  ...  One of the most successful semantics of conventional logic programs based on the CWA is the well-founded semantics.  ...  Note that ¬ is an extension of the negation in the two-valued logic.  ... 
doi:10.5281/zenodo.1062139 fatcat:3eqokvw5sradrlznvxp6t33oze
« Previous Showing results 1 — 15 out of 895 results