Search results for: Ofer Arieli

Items from 1 to 20 out of 35 results

article

Four-Valued Paradefinite Logics

Ofer Arieli, Arnon Avron

Studia Logica > 2017 > 105 > 6 > 1087-1122

Paradefinite (‘beyond the definite’) logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for introducing paradefinite logics. It consists of the four-valued matrices that expand the minimal matrix which is characteristic for first...

chapter

Some Simplified Forms of Reasoning with Distance-Based Entailments

Ofer Arieli, Anna Zamansky

Lecture Notes in Computer Science > Advances in Artificial Intelligence > 36-47

Distance semantics is a robust way of handling dynamically evolving and possibly contradictory information. In this paper we show that in many cases distance-based entailments can be computerized in a general and modular way. We consider two different approaches for reasoning with distance semantics, apply them on some common cases, and show their relation to other known problems.

chapter

Similarity-Based Inconsistency-Tolerant Logics

Ofer Arieli, Anna Zamansky

Lecture Notes in Computer Science > Logics in Artificial Intelligence > Regular Papers > 11-23

Many logics for AI applications that are defined by denotational semantics are trivialized in the presence of inconsistency. It is therefore often desirable, and practically useful, to refine such logics in a way that inconsistency does not cause the derivation of any formula, and, at the same time, inferences with respect to consistent premises are not affected. In this paper, we introduce a general...

article

A graded approach to database repair by context-aware distance semantics

Ofer Arieli, Anna Zamansky

Fuzzy Sets and Systems > 2016 > 298 > C > 4-21

The problem of inconsistent information in databases often arises in the context of data integration and data exchange. In these areas the common assumption is that the real world is consistent, thus an inconsistent database does not correspond to any reliable state and it needs to be “repaired” according to a chosen policy. Many of these policies have to deal with the problem of an exponential blowup...

article

Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations

Ofer Arieli, Christian Straßer

Electronic Notes in Theoretical Computer Science > 2016 > 323 > C > 21-37

Logic-based approaches for analyzing and evaluating arguments have been largely studied in recent years, yielding a variety of formal methods for argumentation-based reasoning. The goal of this paper is to provide an abstract, proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules,...

chapter

An ID-Logic Formalization of the Composition of Autonomous Databases

Bert Nuffelen, Ofer Arieli, Alvaro Cortés-Calabuig, Maurice Bruynooghe

Lecture Notes in Computer Science > Logic Programming and Nonmonotonic Reasoning > Applications > 132-144

We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logic theories that express, at the same time, the two basic challenges in database composition problems: relating different schemas of the local databases to one global schema (schema integration) and...

chapter

Distance-Based Repairs of Databases

Ofer Arieli, Marc Denecker, Maurice Bruynooghe

Lecture Notes in Computer Science > Logics in Artificial Intelligence > Technical Papers > 43-55

We introduce a general framework for repairing inconsistent databases by distance-based considerations. The uniform way of representing repairs and their semantics clarifies the essence behind various approaches to consistency restoration in database systems, helps to compare the underlying formalisms, and relates them to existing methods of defining belief revision operators, merging data sets, and...

chapter

On the Local Closed-World Assumption of Data-Sources

Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Nuffelen, more

Lecture Notes in Computer Science > Logic Programming and Nonmonotonic Reasoning > Applications > 145-157

The Closed-World Assumption (CWA) on a database expresses that an atom not in the database is false. The CWA is only applicable in domains where the database has complete knowledge. In many cases, for example in the context of distributed databases, a data source has only complete knowledge about part of the domain of discourse. In this paper, we introduce an expressive and intuitively appealing method...

chapter

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations

Ofer Arieli, Arnon Avron

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning and Uncertainty > 11-21

In this paper we develop frameworks for logical systems which are able to reflect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. Our sequence of frameworks culminates in what we call plausible, nonmonotonic, multiple-conclusion consequence relations...

chapter

Bilattice-Based Squares and Triangles

Ofer Arieli, Chris Cornelis, Glad Deschrijver, Etienne Kerre

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Fuzzy Models > 563-575

In this paper, Ginsberg’s/Fitting’s theory of bilattices is invoked as a natural accommodation and powerful generalization to both intuitionistic fuzzy sets (IFSs) and interval-valued fuzzy sets (IVFSs), serving on one hand to clarify the exact nature of the relationship between these two common extensions of fuzzy sets, and on the other hand providing a general and intuitively attractive framework...

chapter

Preferential Logics for Reasoning with Graded Uncertainty

Ofer Arieli

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Logics > 515-527

We introduce a family of preferential logics that are useful for handling information with different levels of uncertainty. The corresponding consequence relations are non-monotonic, paraconsistent, adaptive, and rational. It is also shown that any formalism in this family that is based on a well-founded ordering of the different types of uncertainty, can be embedded in a corresponding four-valued...

chapter

Modeling Paraconsistent Reasoning by Classical Logic

Ofer Arieli, Marc Denecker

Lecture Notes in Computer Science > Foundations of Information and Knowledge Systems > 1-14

We introduce a general method for paraconsistent reasoning in knowledge systems by classical second-order formulae. A standard technique for paraconsistent reasoning on inconsistent classical theories is by shifting to multiple-valued logics. We show how these multiple-valued theories can be “shifted back” to two-valued classical theories (through a polynomial transformation), and how preferential...

chapter

Data Integration Using ID-Logic

Bert Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, more

Lecture Notes in Computer Science > Advanced Information Systems Engineering > Data Integration > 67-81

ID-Logic is a knowledge representation language that extends first-order logic with non-monotone inductive definitions. This paper introduces an ID-Logic based framework for database schema integration. It allows us to to uniformly represent and reason with independent source databases that contain information about a common domain, but may have different schemas. The ID-Logic theories that are obtained...

chapter

Representation of Partial Knowledge and Query Answering in Locally Complete Databases

Álvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe

Lecture Notes in Computer Science > Logic for Programming, Artificial Intelligence, and Reasoning > 407-421

The Local Closed-World Assumption (LCWA) is a generalization of Reiter’s Closed-World Assumption (CWA) for relational databases that may be incomplete. Two basic questions that are related to this assumption are: (1) how to represent the fact that only part of the information is known to be complete, and (2) how to properly reason with this information, that is: how to determine whether an answer...

chapter

Database Repair by Signed Formulae

Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe

Lecture Notes in Computer Science > Foundations of Information and Knowledge Systems > Regular Papers > 14-30

We introduce a simple and practically efficient method for repairing inconsistent databases. The idea is to properly represent the underlying problem, and then use off-the-shelf applications for efficiently computing the corresponding solutions. Given a possibly inconsistent database, we represent the possible ways to restore its consistency in terms of signed formulae. Then we show how the...

chapter

Preference Modeling by Rectangular Bilattices

Ofer Arieli, Chris Cornelis, Glad Deschrijver

Lecture Notes in Computer Science > Modeling Decisions for Artificial Intelligence > Regular Papers > 22-33

Many realistic decision aid problems are fraught with facets of ambiguity, uncertainty and conflict, which hamper the effectiveness of conventional and fuzzy preference modeling approaches, and command the use of more expressive representations. In the past, some authors have already identified Ginsberg’s/Fitting’s theory of bilattices as a naturally attractive candidate framework for representing...

chapter

Coherent Composition of Distributed Knowledge-Bases through Abduction

Ofer Arieli, Bert Nuffelen, Marc Denecker, Maurice Bruynooghe

Lecture Notes in Computer Science > Logic for Programming, Artificial Intelligence, and Reasoning > Databases and Knowledge Bases > 624-638

We introduce an abductive method for coherent composition of distributed data. Our approach is based on an abductive inference procedure that is applied on a meta-theory that relates different, possibly inconsistent, input databases. Repairs of the integrated data are computed, resultingin a consistent output database that satisfies the meta-theory. Our framework is based on the A-system, which is...

chapter

Four-valued diagnoses for stratified knowledge-bases

Ofer Arieli, Arnon Avron

Lecture Notes in Computer Science > Computer Science Logic > 1-17

We present a four-valued approach for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing so automaticly. This method is particularly useful for making model-based diagnoses.

chapter

Reasoning with Uncertainty by Nmatrix–Metric Semantics

Ofer Arieli, Anna Zamansky

Lecture Notes in Computer Science > Logic, Language, Information and Computation > Contributed Papers > 69-82

Non-deterministic matrices, a natural generalization of many-valued matrices, are semantic structures in which the value assigned to a complex formula may be chosen non-deterministically from a given set of options. We show that by combining Nmatrices and preferential metric-based considerations, one obtains a family of logics that are useful for reasoning with uncertainty. We investigate the basic...

chapter

Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data

Ofer Arieli, Anna Zamansky

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Logics for Reasoning under Uncertainty > 793-804

We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structures and distance-based considerations. The combination of these two principles leads to a variety of entailment relations that can be used for reasoning about non-deterministic phenomena and are inconsistency-tolerant. We investigate...

Publication date

Set your own date range

Publication type

book (18)
article (17)

INFONA - science communication portal

Search results for: Ofer Arieli

Four-Valued Paradefinite Logics

Some Simplified Forms of Reasoning with Distance-Based Entailments

Similarity-Based Inconsistency-Tolerant Logics

A graded approach to database repair by context-aware distance semantics

Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations

An ID-Logic Formalization of the Composition of Autonomous Databases

Distance-Based Repairs of Databases

On the Local Closed-World Assumption of Data-Sources

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations

Bilattice-Based Squares and Triangles

Preferential Logics for Reasoning with Graded Uncertainty

Modeling Paraconsistent Reasoning by Classical Logic

Data Integration Using ID-Logic

Representation of Partial Knowledge and Query Answering in Locally Complete Databases

Database Repair by Signed Formulae

Preference Modeling by Rectangular Bilattices

Coherent Composition of Distributed Knowledge-Bases through Abduction

Four-valued diagnoses for stratified knowledge-bases

Reasoning with Uncertainty by Nmatrix–Metric Semantics

Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data

Filter options

Publication date

Publication type

Keywords

Data set

Journal

INFONA - science communication portal

Search results for: Ofer Arieli

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Publication type

Keywords

Data set

Journal

Reporting an error / abuse

Sending the report failed

Accessibility options