On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Bibliografski detalji
Glavni autori:	Eiter, T, Gottlob, G, Leone, N
Format:	Journal article
Izdano:	1997

Slični predmeti

Complexity Results for Abductive Logic Programming
od: Eiter, T, i dr.
Izdano: (1995)

Abduction from Logic Programs: Semantics and Complexity
od: Eiter, T, i dr.
Izdano: (1997)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
od: Eiter, T, i dr.
Izdano: (1993)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
od: Eiter, T, i dr.
Izdano: (1995)

Generalized Quantifiers in Logic Programs
od: Eiter, T, i dr.
Izdano: (1997)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
od: Eiter, T, i dr.
Izdano: (1997)

Indiscernible universals
od: Rodriguez-Pereyra, G
Izdano: (2016)

Modular Logic Programming and Generalized Quantifiers
od: Eiter, T, i dr.
Izdano: (1997)

Disjunctive Logic Programming over Finite Structures
od: Eiter, T, i dr.
Izdano: (1994)

Identity and indiscernibility
od: Ketland, J
Izdano: (2011)

Indiscernibility and form
od: Per-Johan Dahl
Izdano: (2018-01-01)

Indiscernibility and form
od: Per-Johan Dahl
Izdano: (2018-01-01)

Complexity and Expressive Power of Logic Programming
od: Dantsin, E, i dr.
Izdano: (1997)

Complexity and expressive power of logic programming
od: Dantsin, E, i dr.
Izdano: (2001)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
od: d'Amato, C, i dr.
Izdano: (2013)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
od: Fanizzi, N, i dr.
Izdano: (2008)

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1995)

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1993)

The argument from almost indiscernibles
od: Rodriguez-Pereyra, G
Izdano: (2016)

Complexity Results for Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1992)

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, i dr.
Izdano: (2006)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
od: Eiter, T, i dr.
Izdano: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
od: Eiter, T, i dr.
Izdano: (2002)

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, i dr.
Izdano: (2006)

Symmetry, indiscernibility, and the generalist picture
od: Moller-Nielsen, T
Izdano: (2015)

L’identité des indiscernables
od: Max Black
Izdano: (2012-11-01)

Danto’s indiscernibility: an intercultural interpretation
od: Peng Feng
Izdano: (2022-10-01)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
od: Eiter, T, i dr.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, i dr.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, i dr.
Izdano: (1994)

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, i dr.
Izdano: (1997)

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, i dr.
Izdano: (1999)

Existential second−order logic over strings
od: Eiter, T, i dr.
Izdano: (2000)

Existential Second−Order Logic over Strings
od: Eiter, T, i dr.
Izdano: (1998)

Indiscernibility Mask Key for Image Steganography
od: Piotr Artiemjew, i dr.
Izdano: (2020-05-01)

Second−Order Logic over Strings: Regular and Non−regular Fragments
od: Eiter, T, i dr.
Izdano: (2001)

The Bundle Theory is compatible with distinct but indiscernible particulars
od: Rodriguez-Pereyra, G
Izdano: (2004)

Perceiving affordances and the problem of visually indiscernible kinds
od: Mette Kristine Hansen
Izdano: (2024-09-01)

Contemporary Art and the Problem of Indiscernibles: An Adverbialist Approach
od: Tomáš Koblížek
Izdano: (2023-03-01)

Local Indiscernibility Relation Reduction for Information Tables
od: Xu Li, i dr.
Izdano: (2022-01-01)