Applied Logic Reading Group
The Applied Logic Reading Group is a weekly seminar organized by Professor Michael Kifer, Professor Annie Liu and their students at the Computer Science Department, Stony Brook University. The topics are related to mathematical logic, applications of logic programming, languages and ontologies for Semantic Web Services, the Flora 2 system for rule-based object-oriented knowledge representation and manipulation, and other topics related to logic-based knowledge management.
Spring 2004:
Integration of information:
- 02/23/2004 (Chang Zhao): A Survey of Approaches to Automatic Schema Matching
Erhard Rahm, Philip A. Bernstein
Available online at: http://citeseer.nj.nec.com/rahm01survey.html
- 03/01/2004 (Chang Zhao): DIKE: a System Supporting the Semi-automatic Construction of Cooperative Information Systems from heterogeneous Databases
Luigi Palopoli, Giorgio Terracina, Domenico Ursino
Download
- 03/08/2004 (Chang Zhao): Developing Metadata-intensive Applications with Rondo
Sergey Melnik, Erhard Rahm, Philip A. Berntein
Semantic Web and Web services:
- 03/15/2004 (Michael Kifer): An overview of the logics for the Semantic Web
- 03/22/2004 (Paul Fodor): OWL (Web Ontology Language)
Available online at: http://www.w3.org/TR/2004/REC-owl-guide-20040210/
- 03/29/2004 (Paul Fodor): OWL-S (An ontology for Web services)
Available online at: http://www.daml.org/services/owl-s/1.0/owl-s.pdf
- 04/05/2004: SWORD: A Developer Toolkit for Web Service Composition
Available online at: http://www2002.org/CDROM/alternate/786/
- 04/19/2004: Semantic e-Workflow Composition
Cardoso, Seth
Fall 2004:
- ??/??/2004 (Aditi Pandit): SHOP2: An HTN Planning System
Available online at: http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume20/nau03a.pdf
- 12/05/2004 (invited speaker Gopal Gupta from University of Texas at Dallas): Analysis and Transformation of Binary Codes
Abstract: In this talk we present our research on analysis and transformation of executable binary codes. Analysis and transformation of binary code becomes important since in many situations when a software product is bought, only the binary executable code is made available. In such situations, the buyer may want to ensure that the code satisfies certain properties. The buyer may also want to transform the binary to improve its performance or eliminate bugs and/or security vulnerabilities.
W.r.t. binary code analysis we consider the problem of re-usability of software component binaries. We develop necessary and sufficient conditions for ensuring that software binaries are reusable and relate them to the coding standards that have been developed in the industry to ensure binary code reusability. These coding standards, in essence, discourage the (i) use of hard-coded pointers, and (ii) writing of non-reentrant code. Checking that binary code satisfies these standards/conditions, however, is undecidable, in general. We employ static analysis methods based on abstract interpretation for checking if a software binary satisfies these conditions. We illustrate our approach by showing how we statically analyze the presence of hard coded pointer variables in assembly code obtained from binaries of digital signal processing applications. We describe the analyzer and present its performance results.
W.r.t. binary code transformation we show how effective methods can be developed for thwarting buffer overflow attacks by transforming binary codes in a semantics preserving fashion. We describe the BinarySecure binary code transformation system that we have developed for buffer overflow attack-proofing of Wintel executables.
Spring 2005:
Fall 2005:
Integration of information:
- Prof Annie Liu: On security policy frameworks
PeerTrust: Automated Trust Negotiatin for Peers on the Semantic Web, by Wolfgang Nejdl, Daniel Olmedilla, and Marianne Winslett
- Prof Scott D. Stoller: Trust management slides
stoller-trust-survey.pdf
- (Chang) Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, and Hans Tompits. Combining Answer Set Programming with Description Logics for the Semantic Web. In Didier Dubois, Christopher Welty, and Mary-Anne Williams, editors, Proceedings Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), June 2-5, Whistler, British Columbia, Canada, pages 141-151. Morgan Kaufmann, 2004.
Available online at: http://www.kr.tuwien.ac.at/staff/eiter/et-archive/kr04-dl_asp.ps.gz
- Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, and Hans Tompits. Well-founded Semantics for Description Logic Programs in the Semantic Web. In G. Antoniou and H. Boley, editors, Proceedings RuleML 2004 Workshop, ISWC Conference, Hiroshima, Japan, November 2004, LNCS. Springer, 2004.
Available online at: http://www.kr.tuwien.ac.at/staff/lukasiew/ruleml04.pdf
- Hui (11/28): Uncertainty and Description Logic Programs: A Proposal for Expressing Rules and Uncertainty on Top of Ontologies Umberto Straccia, ISTI-CNR, Via G. Moruzzi 1, I-56124 Pisa ITALY
Available online at: http://faure.isti.cnr.it/~straccia/projects/Material/Papers/TR-UDLLPSemWeb/TR-UDLLPSemWeb.pdf
- Boris Motik, Ulrike Sattler, and Rudi Studer. Query answering for OWL-DL with rules
In Proc. of the 2004 International Semantic Web Conference (ISWC 2004), pages 549-563, 2004
Available online at: link
- Riccardo Rosati. On the decidability and complexity of integrating ontologies and rules. J. of Web Semantics, 2005
link
- Hui: Octavian Udrea, Yu Deng, Edward Hung, V.S. Subrahmanian, Probabilistic Ontologies and Relational Databases, ODBASE 2005
ProbOntologies_ODBASE05.pdf
Papers from LPNMR-05 :
- Paul (11/7): A. Finzi and T. Lukasiewicz, Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories, LPNMR-05
Available online at: http://www.kr.tuwien.ac.at/staff/lukasiew/lpnmr05.pdf
- Zhiquan (11/12): F. Buccafurri, G. Caminiti, A social semantics for multi-agent systems, LPNMR-05
The following URL seems to be almost identical to what appears in the LPNMR proceedings:
Available online at: http://www.disp.uniroma2.it/CILC2005/downloads/papers/03.Buccafurri_CILC05.pdf
- A. Dekhtyar, M. Dekhtyar, Revisiting the semantics of interval probabilistic logic programs, LPNMR-05
Tutorials from the Reasoning Web summer school, 2005, LNCS 3564:
- J. Alferes and W. May, Evolution of reactivity for the Web
Slides available online at: http://reasoningweb.org/2005/teaching-material/may-wolfgang_alferes-jose-julio_evolution-and-reactivity-on-the-semantic-web.pdf
- M. Baldoni, C. Baroglio, N. Henze, Personalization for the Semantic Web
Available online at: http://www.di.unito.it/~argo/papers/2005_RSS.pdf
Slides: http://reasoningweb.org/2005/teaching-material/henze-nicola_personalisation-for-the-semantic-web-I.pdf
http://reasoningweb.org/2005/teaching-material/baldoni-matteo_personalisation-for-the-semantic-web-II.pdf
- Hui: N. Fuchs, S. Hoefler, K. Kaljurand, F. Rinaldi, G. Schneider, Attempto Controlled English: A Knowldge Representation Language Readable by Humans and Machines
Slides available online at: http://reasoningweb.org/2005/teaching-material/fuchs-norbert_attempto-controlled-english.ppt
- Wlodzimierz Drabent, Towards types for Web Rule Languages
Available online at: http://rewerse.net/deliverables/i3-d2.pdf
http://www.pms.informatik.uni-muenchen.de/publikationen/PMS-FB/PMS-FB-2004-16.pdf
http://reasoningweb.org/2005/teaching-material/drabent-wlodek_towards-types-for-web-rule-languages.pdf
http://reasoningweb.org/2005/teaching-material/drabent-wlodek_towards-types-for-web-rule-languages_examples.pdf
- On the use of logic in negotiation - Michael Wooldridge, Simon Parsons
Available online at: http://www.csc.liv.ac.uk/~mjw/pubs/clcp.pdf
Spring 2006:
Fall 2006 (organized by Prof. Annie Liu, Prof. Michael Kifer is on sabbatical leave):
- Motik, Boris and Horrocks, Ian and Rosati, Riccardo and Sattler, Ulrike, Can OWL and Logic Programming Live Together Happily Ever After?, in Proc. of the 2006 International Semantic Web Conference (ISWC 2006) http://www.cs.man.ac.uk/~horrocks/Publications/download/2006/MHRS06.pdf presented by Paul Fodor
- Combining safe rules and ontologies by interfacing of reasoners, Jakob Henriksson, Jan Maluszynski
- A Logic fo Hybrid Rules, Jos de Bruijin, David Pearce, Axel Polleres, Augustin Valverde
----------
@inproceedings{BecSew04,
author = "Moritz Y. Becker and Peter Sewell",
title = "Cassandra: Flexible Trust Management, Applied to Electronic Health Records",
booktitle = "Proceedings of the 17th IEEE Computer Security Foundations Workshop",
publisher = IEEECS,
year=2004,
month = jun,
URL="http://www.cl.cam.ac.uk/users/mywyb2/http://www.cl.cam.ac.uk/users/pes20/ ",
}
-----------
@techreport{Bec05,
author = "Moritz Y. Becker",
title = "A formal security policy for an {NHS} electronic health record service",
institution = "Computer Laboratory, University of Cambridge",
year = 2005,
type = "Technical Report",
number = "UCAM-CL-TR-628",
month = mar,
note = "81 pages",
url = "http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-628.html ",
}
-------------------
@inproceedings{LiMit03,
author = {Ninghui Li and John C. Mitchell},
title = {DATALOG with Constraints: A Foundation for Trust Management
Languages.},
booktitle = {PADL},
year = 2003,
pages = {58-73},
ee = {http://link.springer.de/link/service/series/0558/bibs/2562/25620058.htm },
crossref = {PADL:2003},
comments = "an overview"
}
http://www.cs.sunysb.edu/~kifer/dood/papers.html
Flora: http://flora.sourceforge.net/ see technical information
- magic set transformations:
@article{BeeRam91,
author = {Catriel Beeri and Raghu Ramakrishnan},
title = {On the power of magic},
journal = JLP,
volume = 10,
number = {3-4},
year = 1991,
issn = {0743-1066},
doi = {http://dx.doi.org/10.1016/0743-1066(91)90038-Q },
publisher = {Elsevier Science Inc.},
}
@article{SipSoi96,
author = {Seppo Sippu and Eljas Soisalon-Soininen},
title = {An analysis of magic sets and related optimization strategies for logic queries},
journal = JACM,
volume = 43,
number = 6,
year = 1996,
pages = {1046--1088},
doi = {http://doi.acm.org/10.1145/235809.235814 },
}
@article{KifLoz90,
author = {Michael Kifer and Eliezer L. Lozinskii},
title = {On Compile-Time Query Optimization in Deductive Databases by
Means of Static Filtering},
journal= {ACM Trans. Database Syst.},
volume = {15},
number = {3},
year = {1990},
pages = {385-426}
}
@article{ChaChoHan93,
author = "Byeong-Mo Chang and Kwang-Moo Choe and Taisook Han",
title = "Static filtering on stratified programs",
journal = "Information Processing Letters",
volume = 47,
number = 5,
pages = "237--244",
day = 8,
month = oct,
year = 1993,
}
@inproceedings{KifLoz86,
author = {Michael Kifer and Eliezer L. Lozinskii},
title = {A Framework for an Efficient Implementation of Deductive Databases},
booktitle = "Proceedings of the 6-th Advanced Database Symposium Aug. 29-30",
year = 1986,
comments = "dynamic filtering",
}
- distributed implmentation:
@inproceedings{BauGarRei05,
author = {Lujo Bauer and Scott Garriss and Michael K. Reiter},
title = {Distributed Proving in Access-Control Systems},
booktitle = {Proceedings of the 2005 IEEE Symposium on Security and Privacy},
year = 2005,
publisher = IEEECS,
pages = {81--95},
doi = { http://dx.doi.org/10.1109/SP.2005.9 },
address = {Washington, DC},
}
@inproceedings{JimSuc01,
author = {Trevor Jim and Dan Suciu},
title = {Dynamically distributed query evaluation},
booktitle = {PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems},
year = 2001,
isbn = {1-58113-361-8},
pages = {28--39},
location = {Santa Barbara, California, United States},
doi = { http://doi.acm.org/10.1145/375551.375557 },
}
- Gopal Gupta , Enrico Pontelli , Khayri A.M. Ali , Mats Carlsson, Manuel V. Hermenegildo, Parallel execution of prolog programs: a survey, ACM Transactions on Programming Languages and Systems
(TOPLAS), v.23 n.4, p.472-602, July 2001.
- Luiz Henrique Castelo Branco, Antonio Francisco do Prado, Wanderley Lopes de Souza, Marcelo Sant'Anna, Automatic Implementation of Distributed Systems Formal Specifications
http://ipdps.cc.gatech.edu/2000/fmppta/18001023.pdf#search=%22distributed%20object%20automatic%20implementation%22
http://www.ime.usp.br/~kon/papers/spe04.pdf#search=%22distributed%20object%20automatic%20implementation%22
Spring 2007 (Professor Annie Liu):
@article{DBLP:journals/ngc/Brough91,
author = {Derek R. Brough, Christopher J. Hogger},
title = {Grammar-Related Transformations of Logic Programs.},
journal = {New Generation Comput.},
volume = {9},
number = {2},
year = {1991},
pages = {115-134},
bibsource = {DBLP, http://dblp.uni-trier.de
}
}
- Object oriented languages modelling and verification:
@InProceedings{martin-finding,
author = "Michael Martin and Benjamin Livshits and Monica S. Lam",
title = "Finding application errors and security flaws using {PQL}: a program query language",
booktitle = "OOPSLA '05: Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications",
year = "2005",
ISBN = "1-59593-031-0",
pages = "365--383",
location = "San Diego, CA, USA",
doi = "http://doi.acm.org/10.1145/1094811.1094840",
url = "http://citeseer.ist.psu.edu/martin05finding.html"
}
Invariants papers:
- Automatic inference of class invariants, Francessco Logozzo
- Ditto: Automatic Incrementalization of data Structure Invariant Checks (in Java)
- The Daikon system for dynamic detection of likely invariats, Michael D. ernst, Jeff H. Perkins, Philip J. Guo, Stephen McCamant, Carlos Pacheco,Matthew S. Tschantz, Chen Xiao
- Transaction Logic Tabling, Paul Fodor, Michael Kifer, presentation by Paul Fodor - pdf attached
- Tom Rothamel presented: Steinbrunn, M., Moerkotte, G., Kemper, A., Heuristic and randomized optimization for the join ordering problem,
- Vance, B. , Maier, D., Rapid bushy join-order optimization with cartezian product. In Proc. ACM SIGMOD, 1996
Incremental view maintanance
Fall 2007: