AAAAAA

   
Results: 1-22 |
Results: 22
A FIRST-ORDER REPRESENTATION OF STABLE MODELS
Authors: EITER T LU J SUBRAHMANIAN VS
Citation: T. Eiter et al., A FIRST-ORDER REPRESENTATION OF STABLE MODELS, AI communications, 11(1), 1998, pp. 53-73
DOUBLE HORN FUNCTIONS
Authors: EITER T IBARAKI T MAKINO K
Citation: T. Eiter et al., DOUBLE HORN FUNCTIONS, Information and computation (Print), 144(2), 1998, pp. 155-190
EXPRESSIVE POWER AND COMPLEXITY OF PARTIAL MODELS FOR DISJUNCTIVE DEDUCTIVE DATABASES
Authors: EITER T LEONE N SACCA D
Citation: T. Eiter et al., EXPRESSIVE POWER AND COMPLEXITY OF PARTIAL MODELS FOR DISJUNCTIVE DEDUCTIVE DATABASES, Theoretical computer science, 206(1-2), 1998, pp. 181-218
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
ON THE PARTIAL SEMANTICS FOR DISJUNCTIVE DEDUCTIVE DATABASES
Authors: EITER T LEONE N SACCA D
Citation: T. Eiter et al., ON THE PARTIAL SEMANTICS FOR DISJUNCTIVE DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 59-96
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
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
DISTANCE MEASURES FOR POINT SETS AND THEIR COMPUTATION
Authors: EITER T MANNILA H
Citation: T. Eiter et H. Mannila, DISTANCE MEASURES FOR POINT SETS AND THEIR COMPUTATION, Acta informatica, 34(2), 1997, pp. 109-133
QUERYING DISJUNCTIVE DATABASES THROUGH NONMONOTONIC LOGICS
Authors: BONATTI PA EITER T
Citation: Pa. Bonatti et T. Eiter, QUERYING DISJUNCTIVE DATABASES THROUGH NONMONOTONIC LOGICS, Theoretical computer science, 160(1-2), 1996, pp. 321-363
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
RECOGNIZING RENAMABLE GENERALIZED PROPOSITIONAL HORN FORMULAS IS NP-COMPLETE
Authors: EITER T KILPELAINEN P MANNILA H
Citation: T. Eiter et al., RECOGNIZING RENAMABLE GENERALIZED PROPOSITIONAL HORN FORMULAS IS NP-COMPLETE, Discrete applied mathematics, 59(1), 1995, pp. 23-31
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
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
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
GENERATING BOOLEAN MU-EXPRESSIONS
Authors: EITER T
Citation: T. Eiter, GENERATING BOOLEAN MU-EXPRESSIONS, Acta informatica, 32(2), 1995, pp. 171-187
EXACT TRANSVERSAL HYPERGRAPHS AND APPLICATION TO BOOLEAN MU-FUNCTIONS
Authors: EITER T
Citation: T. Eiter, EXACT TRANSVERSAL HYPERGRAPHS AND APPLICATION TO BOOLEAN MU-FUNCTIONS, Journal of symbolic computation, 17(3), 1994, pp. 215-225
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
Risultati: 1-22 |