AAAAAA

   
Results: 1-24 |
Results: 24
EDITORIAL NOTE
Authors: GOTTLOB G
Citation: G. Gottlob, EDITORIAL NOTE, AI communications, 11(1), 1998, pp. 3-3
THEORETICAL COMPUTER-SCIENCE - DATABASE THEORY - FOREWORD
Authors: GOTTLOB G VARDI MY
Citation: G. Gottlob et My. Vardi, THEORETICAL COMPUTER-SCIENCE - DATABASE THEORY - FOREWORD, Theoretical computer science, 190(2), 1998, pp. 113-113
ON THE EXPRESSIVENESS OF FRAME SATISFIABILITY AND FRAGMENTS OF 2ND-ORDER LOGIC
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, ON THE EXPRESSIVENESS OF FRAME SATISFIABILITY AND FRAGMENTS OF 2ND-ORDER LOGIC, The Journal of symbolic logic, 63(1), 1998, pp. 73-82
DEFAULT LOGIC AS A QUERY LANGUAGE
Authors: CADOLI M EITER T GOTTLOB G
Citation: M. Cadoli et al., DEFAULT LOGIC AS A QUERY LANGUAGE, IEEE transactions on knowledge and data engineering, 9(3), 1997, pp. 448-463
UNTITLED
Authors: GOTTLOB G
Citation: G. Gottlob, UNTITLED, AI communications, 10(1), 1997, pp. 1-1
EXPRESSIVENESS OF STABLE MODEL SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH FUNCTIONS
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, EXPRESSIVENESS OF STABLE MODEL SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH FUNCTIONS, The journal of logic programming, 33(2), 1997, pp. 167-178
DISJUNCTIVE DATALOG
Authors: EITER T GOTTLOB G MANNILA H
Citation: T. Eiter et al., DISJUNCTIVE DATALOG, ACM transactions on database systems, 22(3), 1997, pp. 364-418
ABDUCTION FROM LOGIC PROGRAMS - SEMANTICS AND COMPLEXITY
Authors: EITER T GOTTLOB G LEONE N
Citation: T. Eiter et al., ABDUCTION FROM LOGIC PROGRAMS - SEMANTICS AND COMPLEXITY, Theoretical computer science, 189(1-2), 1997, pp. 129-177
RELATIVIZED LOGSPACE AND GENERALIZED QUANTIFIERS OVER FINITE ORDERED STRUCTURES
Authors: GOTTLOB G
Citation: G. Gottlob, RELATIVIZED LOGSPACE AND GENERALIZED QUANTIFIERS OVER FINITE ORDERED STRUCTURES, The Journal of symbolic logic, 62(2), 1997, pp. 545-574
SEMANTICS AND COMPLEXITY OF ABDUCTION FROM DEFAULT THEORIES
Authors: EITER T GOTTLOB G LEONE N
Citation: T. Eiter et al., SEMANTICS AND COMPLEXITY OF ABDUCTION FROM DEFAULT THEORIES, Artificial intelligence, 90(1-2), 1997, pp. 177-223
EXTENDING OBJECT-ORIENTED SYSTEMS WITH ROLES
Authors: GOTTLOB G SCHREFL M ROCK B
Citation: G. Gottlob et al., EXTENDING OBJECT-ORIENTED SYSTEMS WITH ROLES, ACM transactions on information systems, 14(3), 1996, pp. 268-296
A NON-GROUND REALIZATION OF THE STABLE AND WELL-FOUNDED SEMANTICS
Authors: GOTTLOB G MARCUS S NERODE A SALZER G SUBRAHMANIAN VS
Citation: G. Gottlob et al., A NON-GROUND REALIZATION OF THE STABLE AND WELL-FOUNDED SEMANTICS, Theoretical computer science, 166(1-2), 1996, pp. 221-262
NORMAL FORMS FOR 2ND-ORDER LOGIC OVER FINITE STRUCTURES, AND CLASSIFICATION OF NP OPTIMIZATION PROBLEMS
Authors: EITER T GOTTLOB G GUREVICH Y
Citation: T. Eiter et al., NORMAL FORMS FOR 2ND-ORDER LOGIC OVER FINITE STRUCTURES, AND CLASSIFICATION OF NP OPTIMIZATION PROBLEMS, Annals of pure and applied Logic, 78(1-3), 1996, pp. 111-125
THE COMPLEXITY OF NESTED COUNTERFACTUALS AND ITERATED KNOWLEDGE-BASE REVISIONS
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, THE COMPLEXITY OF NESTED COUNTERFACTUALS AND ITERATED KNOWLEDGE-BASE REVISIONS, Journal of computer and system sciences, 53(3), 1996, pp. 497-512
ON THE COMPUTATIONAL COST OF DISJUNCTIVE LOGIC PROGRAMMING - PROPOSITIONAL CASE
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, ON THE COMPUTATIONAL COST OF DISJUNCTIVE LOGIC PROGRAMMING - PROPOSITIONAL CASE, Annals of mathematics and artificial intelligence, 15(3-4), 1995, pp. 289-323
THE COMPLEXITY OF DEFAULT REASONING UNDER THE STATIONARY FIXED-POINT SEMANTICS
Authors: GOTTLOB G
Citation: G. Gottlob, THE COMPLEXITY OF DEFAULT REASONING UNDER THE STATIONARY FIXED-POINT SEMANTICS, Information and computation, 121(1), 1995, pp. 81-92
IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS, SIAM journal on computing, 24(6), 1995, pp. 1278-1304
TRANSLATING DEFAULT LOGIC INTO STANDARD AUTOEPISTEMIC LOGIC
Authors: GOTTLOB G
Citation: G. Gottlob, TRANSLATING DEFAULT LOGIC INTO STANDARD AUTOEPISTEMIC LOGIC, Journal of the Association for Computing Machinery, 42(4), 1995, pp. 711-740
NP TREES AND CARNAPS MODAL LOGIC
Authors: GOTTLOB G
Citation: G. Gottlob, NP TREES AND CARNAPS MODAL LOGIC, Journal of the Association for Computing Machinery, 42(2), 1995, pp. 421-457
THE COMPLEXITY OF LOGIC-BASED ABDUCTION
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, THE COMPLEXITY OF LOGIC-BASED ABDUCTION, Journal of the Association for Computing Machinery, 42(1), 1995, pp. 3-42
CUMULATIVE DEFAULT LOGIC - FINITE CHARACTERIZATION, ALGORITHMS, AND COMPLEXITY
Authors: GOTTLOB G ZHANG MY
Citation: G. Gottlob et My. Zhang, CUMULATIVE DEFAULT LOGIC - FINITE CHARACTERIZATION, ALGORITHMS, AND COMPLEXITY, Artificial intelligence, 69(1-2), 1994, pp. 329-345
PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI(P)(2)-COMPLETE (VOL 114, PG 231, 1993)
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI(P)(2)-COMPLETE (VOL 114, PG 231, 1993), Theoretical computer science, 118(2), 1993, pp. 315-315
PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI-P2-COMPLETE
Authors: EITER T GOTTLOB G
Citation: T. Eiter et G. Gottlob, PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI-P2-COMPLETE, Theoretical computer science, 114(2), 1993, pp. 231-245
REMOVING REDUNDANCY FROM A CLAUSE
Authors: GOTTLOB G FERMULLER CG
Citation: G. Gottlob et Cg. Fermuller, REMOVING REDUNDANCY FROM A CLAUSE, Artificial intelligence, 61(2), 1993, pp. 263-289
Risultati: 1-24 |