# Search results for: Ofer Arieli

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

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

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

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

*schema integration*) and...

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

*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...

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

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

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

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

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

*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...

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

*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...

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

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

*A*-system, which is...

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

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