Yannis Smaragdakis - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged Datalog

Certain Answers for Views and Queries Expressed as Non-recursive Datalog Programs with NegationVictor Felea. aciids 2011: 67-77 [doi]

On the Complexity of the Bernays-Schönfinkel Class with DatalogWitold Charatonik, Piotr Witkowski. lpar 2010: 187-201 [doi]

Strictly declarative specification of sophisticated points-to analysesMartin Bravenboer, Yannis Smaragdakis. OOPSLA 2009: 243-262 [doi]

Monadic Datalog Tree TransducersMatthias Büchse, Torsten Stüber. LATA 2009: 267-278 [doi]

RIF RuleML Rosetta Ring: Round-Tripping the Dlex Subset of Datalog RuleML and RIF-CoreHarold Boley. ruleml 2009: 29-42 [doi]

Twofold Extensions of Fuzzy DatalogÁgnes Achs. wilf 2007: 298-305 [doi]

Datalog Programs over Infinite Databases, RevisitedSara Cohen, Joseph Gil, Evelina Zarivach. DBPL 2007: 32-47 [doi]

From Fuzzy - to Bipolar - DatalogÁgnes Achs. eusflat 2007: 221-227 [doi]

Boon Thau Loo speaks out: on his SIGMOD dissertation award, better networking through datalog, life as an assistant professor, and moreMarianne Winslett. SIGMOD, 36(3):41-45, 2007. [doi]

On the Decidability of Containment of Recursive Datalog Queries - Preliminary reportPiero A. Bonatti. PODS 2004: 297-306 [doi]

RAP: Framework for Mining Frequent Datalog PatternsJan Blatak, Lubos Popelínsky, Miloslav Nepil. kdid 2002: 99-100 [doi]

More on tractable disjunctive DatalogRachel Ben-Eliyahu-Zohary, Luigi Palopoli, Victoria Zemlyanker. jlp, 46(1-2):61-101, 2000.

Circumscribing DATALOG: Expressive Power and ComplexityMarco Cadoli, Luigi Palopoli. TCS, 193(1-2):215-244, 1998. [doi]

Subsumption-Stratified DatalogMichael Meskes. jlp, 36(1):55-90, 1998.

Safe Stratified Datalog with Integer Order Does Not Have SyntaxAlexei P. Stolboushkin, Michael A. Taitslin. TODS, 23(1):100-109, 1998. [doi]

Evaluation Strategies of Fuzzy DatalogÁgnes Achs. actaC, 13(1):85-102, 1997. [doi]

MP: An Efficient Method for Calculating the Minimum Herbrand Model of Chain Datalog ProgramsAnke D. Rieger. ecai 1996: 385-389

Restructuring Chain Datalog Programs (Preliminary Report)Anke D. Rieger. ilp 1997: 245-264

On the Expected Size of Recursive Datalog QueriesS. Seshadri, Jeffrey F. Naughton. jcss, 51(2):137-148, 1995.

Fuzzy Extension of DatalogÁgnes Achs, Attila Kiss. actaC, 12(2):153-166, 1995. [doi]

Subsumptions-stratifiziertes DatalogMichael Meskes. gvd 1995: 118-122

Concept : a system for deriving datalog inheritanceMiguel-Angel Oros, Paul Y. Gloess. jfplc 1995: 353-356

Mapping Datalog Program Execution to Networks of ProcesorsSumit Ganguly, Abraham Silberschatz, Shalom Tsur. tkde, 7(3):351-361, 1995. [doi]

Combining Datalog Databases Using PrioritiesShekhar Pradhan. comad 1994:

About Boundedness for Some Datalog and Datalog:::neg::: ProgramsIrène Guessarian, Marcos Veloso Peixoto. logcom, 4(4):375-403, 1994.

Inferring Inheritance from Datalog ProgramsMiguel-Angel Oros, Paul Y. Gloess. SLP 1994: 680

Low Complexity Aggregation in GraphLog and DatalogMariano P. Consens, Alberto O. Mendelzon. TCS, 116(1&2):95-116, 1993.

Inheritance in DatalogMiguel-Angel Oros, Paul Y. Gloess. lpe 1993: 52-58

About Boundedness for some DATALOG and DATALOG_neg ProgramsIrène Guessarian, Marcos Veloso Peixoto. mfcs 1992: 284-297

An Efficient Bottom-ip Evaluation for DatalogJia Liang Han. deductive 1992: 146-154

Parallel Bottom-Up Processing of Datalog QueriesSumit Ganguly, Abraham Silberschatz, Shalom Tsur. jlp, 14(1&2):101-126, 1992.

On Datalog Linearization of Chain QueriesGuozhu Dong. BIRTHDAY 1992: 181-206

On the Expected Size of Recursive Datalog QueriesS. Seshadri, Jeffrey F. Naughton. PODS 1991: 268-279 [doi]

Parallelizing Datalog: Function Symbols make a DifferenceJürgen Seib. pdis 1991: 90-97 [doi]

Parallele Evaluierung von Datalog-ProgrammenJürgen Seib, Georg Lausen. btw 1991: 344-361

Hypothetical Datalog: Complexity and ExpressibilityAnthony J. Bonner. TCS, 76(1):3-51, 1990.

Low Complexity Aggregation in GraphLog and DatalogMariano P. Consens, Alberto O. Mendelzon. icdt 1990: 379-394 [doi]

A Framework for the Parallel Processing of Datalog QueriesSumit Ganguly, Abraham Silberschatz, Shalom Tsur. SIGMOD 1990: 143-152 [doi]

Deciding Boundedness for Uniformly Connected Datalog ProgramsIrène Guessarian. icdt 1990: 395-405 [doi]

Inductive Pebble Games and the Expressive Power of DatalogV. S. Lakshmanan, Alberto O. Mendelzon. PODS 1989: 301-310 [doi]

Deciding Finiteness, Groundness and Domain Independence of Pure Datalog QueriesBernhard Convent. eik, 25(8/9):401-416, 1989.

Hypothetical Datalog: Negation and Linear RecursionAnthony J. Bonner. PODS 1989: 286-300 [doi]

On Distributed Processibility of Datalog Queries by Decomposing DatabasesGuozhu Dong. SIGMOD 1989: 26-35 [doi]

Hypothetical Datalog: Complexity and ExpressiblityAnthony J. Bonner. icdt 1988: 144-160 [doi]

Automates DatalogBernard Lang. bda 1988: 21-52

Non-Deterministic Choice in DatalogRavi Krishnamurthy, Shamim A. Naqvi. jcdkb 1988: 416-424

Datalog AutomataBernard Lang. jcdkb 1988: 389-404

Une extension de Datalog avec fonctions agregatL. Chen. bda 1988: 239-256

Optimisation de programmes récursifs Datalog étendus en utilisant des équations fonctionnelles au point fixeGeorges Gardarin. bda 1987: 401-428

Logique typée at DATALOGL. Chen. bda 1987: 111-142

runs on WebDSL