On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Bibliografiske detaljer
Main Authors:	Eiter, T, Gottlob, G, Leone, N
Format:	Journal article
Udgivet:	1997

Lignende værker

Complexity Results for Abductive Logic Programming
af: Eiter, T, et al.
Udgivet: (1995)

Abduction from Logic Programs: Semantics and Complexity
af: Eiter, T, et al.
Udgivet: (1997)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
af: Eiter, T, et al.
Udgivet: (1993)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
af: Eiter, T, et al.
Udgivet: (1995)

Generalized Quantifiers in Logic Programs
af: Eiter, T, et al.
Udgivet: (1997)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
af: Eiter, T, et al.
Udgivet: (1997)

Indiscernible universals
af: Rodriguez-Pereyra, G
Udgivet: (2016)

Modular Logic Programming and Generalized Quantifiers
af: Eiter, T, et al.
Udgivet: (1997)

Disjunctive Logic Programming over Finite Structures
af: Eiter, T, et al.
Udgivet: (1994)

Identity and indiscernibility
af: Ketland, J
Udgivet: (2011)

Indiscernibility and form
af: Per-Johan Dahl
Udgivet: (2018-01-01)

Indiscernibility and form
af: Per-Johan Dahl
Udgivet: (2018-01-01)

Complexity and Expressive Power of Logic Programming
af: Dantsin, E, et al.
Udgivet: (1997)

Complexity and expressive power of logic programming
af: Dantsin, E, et al.
Udgivet: (2001)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
af: d'Amato, C, et al.
Udgivet: (2013)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
af: Fanizzi, N, et al.
Udgivet: (2008)

The Complexity of Logic−Based Abduction
af: Eiter, T, et al.
Udgivet: (1995)

The Complexity of Logic−Based Abduction
af: Eiter, T, et al.
Udgivet: (1993)

The argument from almost indiscernibles
af: Rodriguez-Pereyra, G
Udgivet: (2016)

Complexity Results for Logic−Based Abduction
af: Eiter, T, et al.
Udgivet: (1992)

Reasoning under minimal upper bounds in propositional logic
af: Eiter, T, et al.
Udgivet: (2006)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
af: Eiter, T, et al.
Udgivet: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
af: Eiter, T, et al.
Udgivet: (2002)

Reasoning under minimal upper bounds in propositional logic
af: Eiter, T, et al.
Udgivet: (2006)

Symmetry, indiscernibility, and the generalist picture
af: Moller-Nielsen, T
Udgivet: (2015)

L’identité des indiscernables
af: Max Black
Udgivet: (2012-11-01)

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

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
af: Eiter, T, et al.
Udgivet: (1997)

Default Logic as a Query Language
af: Cadoli, M, et al.
Udgivet: (1997)

Default Logic as a Query Language
af: Cadoli, M, et al.
Udgivet: (1994)

On the Complexity of Some Inductive Logic Programming Problems
af: Gottlob, G, et al.
Udgivet: (1997)

On the Complexity of Some Inductive Logic Programming Problems
af: Gottlob, G, et al.
Udgivet: (1999)

Existential second−order logic over strings
af: Eiter, T, et al.
Udgivet: (2000)

Existential Second−Order Logic over Strings
af: Eiter, T, et al.
Udgivet: (1998)

Indiscernibility Mask Key for Image Steganography
af: Piotr Artiemjew, et al.
Udgivet: (2020-05-01)

Second−Order Logic over Strings: Regular and Non−regular Fragments
af: Eiter, T, et al.
Udgivet: (2001)

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

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

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

Local Indiscernibility Relation Reduction for Information Tables
af: Xu Li, et al.
Udgivet: (2022-01-01)