Abstract
No abstract available.
Cited By
- Gottlob G, Hernich A, Kupke C and Lukasiewicz T (2021). Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity, Journal of the ACM, 68:5, (1-87), Online publication date: 31-Oct-2021.
- Rauf B, Abbas H, Usman M, Zia T, Iqbal W, Abbas Y and Afzal H (2021). Application Threats to Exploit Northbound Interface Vulnerabilities in Software Defined Networks, ACM Computing Surveys, 54:6, (1-36), Online publication date: 1-Jul-2021.
- Maksimov M, Kokaly S and Chechik M (2019). A Survey of Tool-supported Assurance Case Assessment Techniques, ACM Computing Surveys, 52:5, (1-34), Online publication date: 30-Sep-2020.
- Alrajeh D, Cailliau A and van Lamsweerde A Adapting requirements models to varying environments Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering, (50-61)
- Hammann S, Radomirović S, Sasse R and Basin D User Account Access Graphs Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1405-1422)
- Bertolissi C, den Hartog J and Zannone N Using Provenance for Secure Data Fusion in Cooperative Systems Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, (185-194)
- Bredereck R and Luo J Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, (819-827)
- Saldanha E, Hölldobler S, Ramli C and Medinacelli L (2019). A core method for the weak completion semantics with skeptical abduction, Journal of Artificial Intelligence Research, 63:1, (51-86), Online publication date: 1-Sep-2018.
- Ramakrishnan C State-space search with tabled logic programs Declarative Logic Programming, (427-472)
- Truszczynski M An introduction to the stable and well-founded semantics of logic programs Declarative Logic Programming, (121-177)
- Kifer M and Liu Y (2018). Declarative Logic Programming, 10.1145/3191315, Online publication date: 1-Sep-2018.
- Triska J and Vychodil V (2017). Logic of temporal attribute implications, Annals of Mathematics and Artificial Intelligence, 79:4, (307-335), Online publication date: 1-Apr-2017.
- Zhou A, He B, Cheng X and Lau C (2017). A Declarative Optimization Engine for Resource Provisioning of Scientific Workflows in Geo-Distributed Clouds, IEEE Transactions on Parallel and Distributed Systems, 28:3, (647-661), Online publication date: 1-Mar-2017.
- Tran A, Dietrich J, Guesgen H and Marsland S (2017). Parallel symmetric class expression learning, The Journal of Machine Learning Research, 18:1, (2145-2178), Online publication date: 1-Jan-2017.
- Gallego Arias E, Lipton J and Mariño J (2017). Constraint logic programming with a relational machine, Formal Aspects of Computing, 29:1, (97-124), Online publication date: 1-Jan-2017.
- Catherine R and Cohen W Personalized Recommendations using Knowledge Graphs Proceedings of the 10th ACM Conference on Recommender Systems, (325-332)
- Mesnard F, Payet É and Vanhoof W Towards a framework for algorithm recognition in binary code Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, (202-213)
- Desouter B, Van Dooren M, Schrijvers T and Vandenbroucke A Tabling as a library with delimited control Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (4145-4149)
- Vychodil V (2016). Parameterizing the Semantics of Fuzzy Attribute Implications by Systems of Isotone Galois Connections, IEEE Transactions on Fuzzy Systems, 24:3, (645-660), Online publication date: 1-Jun-2016.
- Alrajeh D, van Lamsweerde A, Kramer J, Russo A and Uchitel S Risk-driven revision of requirements models Proceedings of the 38th International Conference on Software Engineering, (855-865)
- Zhou A, He B, Cheng X and Lau C A Declarative Optimization Engine for Resource Provisioning of Scientific Workflows in IaaS Clouds Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing, (223-234)
- McCarty L How to ground a language for legal discourse in a prototypical perceptual semantics Proceedings of the 15th International Conference on Artificial Intelligence and Law, (89-98)
- Vychodil V (2015). On minimal sets of graded attribute implications, Information Sciences: an International Journal, 294:C, (478-488), Online publication date: 10-Feb-2015.
- Sakai H, Wu M and Nakata M (2014). Apriori-Based Rule Generation in Incomplete Information Databases and Non-Deterministic Information Systems, Fundamenta Informaticae, 130:3, (343-376), Online publication date: 1-Jul-2014.
- Gaintzarain J and Lucio P (2013). Logical foundations for more expressive declarative temporal logic programming languages, ACM Transactions on Computational Logic, 14:4, (1-41), Online publication date: 1-Nov-2013.
- Grosof B Rapid text-based authoring of defeasible higher-order logic formulas, via textual logic and rulelog Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web, (2-11)
- Gonçalves R and Alferes J Deontic logic programs Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, (1333-1334)
- Kuhr T and Vychodil V Representing fuzzy logic programs by graded attribute implications Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence, (246-257)
- Balbiani P and Yaacoub A Deciding the bisimilarity relation between datalog goals Proceedings of the 13th European conference on Logics in Artificial Intelligence, (67-79)
- Monjaraz R and Mariño J From the π-calculus to flat GHC Proceedings of the 14th symposium on Principles and practice of declarative programming, (163-172)
- Alrajeh D, Kramer J, Lamsweerde A, Russo A and Uchitel S Generating obstacle conditions for requirements completeness Proceedings of the 34th International Conference on Software Engineering, (705-715)
- Kaneiwa K and Nguyen P Sorted hyper-predicate knowledge bases for ontologies and rules Proceedings of the 27th Annual ACM Symposium on Applied Computing, (312-319)
- Naish L, Søndergaard H and Horsfall B Logic programming Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128, (49-58)
- Naish L Declarative diagnosis of floundering in prolog Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122, (49-56)
- Baral C Logic programming and uncertainty Proceedings of the 5th international conference on Scalable uncertainty management, (22-37)
- Orsi G and Pieris A (2020). Optimizing query answering under ontological constraints, Proceedings of the VLDB Endowment, 4:11, (1004-1015), Online publication date: 1-Aug-2011.
- Corapi D, Russo A and Lupu E Inductive logic programming in answer set programming Proceedings of the 21st international conference on Inductive Logic Programming, (91-97)
- Nederhof M Transforming lexica as trees Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, (37-45)
- Afrati F, Damigos M and Gergatsoulis M (2010). Query containment under bag and bag-set semantics, Information Processing Letters, 110:10, (360-369), Online publication date: 1-Apr-2010.
- Giordano L and Toni F Knowledge representation and non-monotonic reasoning A 25-year perspective on logic programming, (87-111)
- Bossi A and Meo M Theoretical foundations and semantics of logic programming A 25-year perspective on logic programming, (15-36)
- Bossi A (2009). S-semantics for logic programming, Theoretical Computer Science, 410:46, (4692-4703), Online publication date: 1-Nov-2009.
- Hussain S and Rao M Learning hereditary and reductive prolog programs from entailment Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications, (546-555)
- Kaneiwa K and Mizoguchi R (2009). Distributed reasoning with ontologies and rules in order-sorted logic programming, Web Semantics: Science, Services and Agents on the World Wide Web, 7:3, (252-270), Online publication date: 1-Sep-2009.
- Senni V, Pettorossi A and Proietti M (2009). A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs, Fundamenta Informaticae, 96:3, (373-393), Online publication date: 1-Aug-2009.
- Senni V, Pettorossi A and Proietti M (2009). A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs, Fundamenta Informaticae, 96:3, (373-393), Online publication date: 1-Aug-2009.
- Ragone A, Straccia U, Di Noia T, Di Sciascio E and Donini F (2009). Fuzzy matchmaking in e-marketplaces of peer entities using Datalog, Fuzzy Sets and Systems, 160:2, (251-268), Online publication date: 15-Jan-2009.
- Saha D Extending logical attack graphs for efficient vulnerability analysis Proceedings of the 15th ACM conference on Computer and communications security, (63-74)
- Hinrichs T and Genesereth M Injecting the how into the what Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning, (92-102)
- Gutmann B, Kimmig A, Kersting K and De Raedt L Parameter learning in probabilistic databases Proceedings of the 2008th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I, (473-488)
- Bryant D and Krause P (2008). A review of current defeasible reasoning implementations, The Knowledge Engineering Review, 23:3, (227-260), Online publication date: 1-Sep-2008.
- Bonet B and Geffner H (2008). Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Artificial Intelligence, 172:12-13, (1579-1604), Online publication date: 1-Aug-2008.
- Lu L Inferring precise polymorphic type dependencies in logic programs Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (143-151)
- Leuschel M Declarative programming for verification Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (1-7)
- Bonatti P, Pontelli E and Son T Credulous resolution for answer set programming Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (418-423)
- Caballero R, García-Ruiz Y and Sáenz-Pérez F (2008). A New Proposal for Debugging Datalog Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 216, (79-92), Online publication date: 1-Jul-2008.
- Coppola C, Gerla G and Pacelli T (2008). Convergence and fixed points by fuzzy orders, Fuzzy Sets and Systems, 159:10, (1178-1190), Online publication date: 1-May-2008.
- Wang J and Liu C Fuzzy constraint logic programming with answer set semantics Proceedings of the 2nd international conference on Knowledge science, engineering and management, (52-60)
- Hinrichs T and Genesereth M Reformulation for extensional reasoning Proceedings of the 7th International conference on Abstraction, reformulation, and approximation, (215-229)
- Barker S Action-status access control Proceedings of the 12th ACM symposium on Access control models and technologies, (195-204)
- Marek V and Remmel J Compactness Properties for Stable Semantics of Logic Programs Proceedings of the international symposium on Logical Foundations of Computer Science, (379-400)
- Vidal G Quasi-terminating logic programs for ensuring the termination of partial evaluation Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (51-60)
- Sarna-Starosta B and Ramakrishnan C Compiling constraint handling rules for efficient tabled evaluation Proceedings of the 9th international conference on Practical Aspects of Declarative Languages, (170-184)
- Bader S, Hitzler P, Hölldobler S and Witzel A A fully connectionist model generator for covered first-order logic programs Proceedings of the 20th international joint conference on Artifical intelligence, (666-671)
- Ferraris P, Lee J and Lifschitz V A new perspective on stable models Proceedings of the 20th international joint conference on Artifical intelligence, (372-379)
- Buszkowski W (2007). Rough Sets and Learning by Unification, Fundamenta Informaticae, 75:1-4, (107-121), Online publication date: 1-Jan-2007.
- Ramakrishnan C, Ramakrishnan I and Warren D Deductive spreadsheets using tabled logic programming Proceedings of the 22nd international conference on Logic Programming, (391-405)
- Cheney J The semantics of nominal logic programs Proceedings of the 22nd international conference on Logic Programming, (361-375)
- King A, Lu L and Genaim S Detecting determinacy in prolog programs Proceedings of the 22nd international conference on Logic Programming, (132-147)
- Wang J and Liu C Agent-Oriented probabilistic logic programming with fuzzy constraints Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems, (664-671)
- Leuschel M, Craig S and Elphick D Supervising offline partial evaluation of logic programs using online techniques Proceedings of the 16th international conference on Logic-based program synthesis and transformation, (43-59)
- Sintek M and Kiesel M RDFBroker Proceedings of the 3rd European conference on The Semantic Web: research and applications, (363-377)
- Bonatti P, Olmedilla D and Peer J Advanced Policy Explanations on the Web Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy, (200-204)
- Berry A, SanJuan E and Sigayret A (2006). Generalized domination in closure systems, Discrete Applied Mathematics, 154:7, (1064-1084), Online publication date: 1-May-2006.
- Weitl F and Freitag B (2006). Checking content consistency of integrated web documents, Journal of Computer Science and Technology, 21:3, (418-429), Online publication date: 1-May-2006.
- Wang J, Ju S and Liu C (2006). Agent-oriented probabilistic logic programming, Journal of Computer Science and Technology, 21:3, (412-417), Online publication date: 1-May-2006.
- Getoor L and Grant J (2006). PRL, Machine Language, 62:1-2, (7-31), Online publication date: 1-Feb-2006.
- King A and Martin J (2006). Control Generation by Program Transformation, Fundamenta Informaticae, 69:1-2, (179-218), Online publication date: 1-Jan-2006.
- King A and Martin J (2005). Control Generation by Program Transformation, Fundamenta Informaticae, 69:1-2, (179-218), Online publication date: 1-Jan-2006.
- Dix J, Kraus S and Subrahmanian V (2006). Heterogeneous temporal probabilistic agents, ACM Transactions on Computational Logic, 7:1, (151-198), Online publication date: 1-Jan-2006.
- Gire F and Plourde C (2005). A New Partial Semantics for Disjunctive Deductive Databases, Fundamenta Informaticae, 67:4, (323-342), Online publication date: 1-Dec-2005.
- Moreno G and Pascual V Programming with fuzzy logic and mathematical functions Proceedings of the 6th international conference on Fuzzy Logic and Applications, (89-98)
- Pettorossi A, Proietti M and Senni V Transformational verification of parameterized protocols using array formulas Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation, (23-43)
- Simon A and King A Exploiting sparsity in polyhedral analysis Proceedings of the 12th international conference on Static Analysis, (336-351)
- Guo H Mode-directed fixed point computation Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning, (253-265)
- Atluri V and Warner J Supporting conditional delegation in secure workflow management systems Proceedings of the tenth ACM symposium on Access control models and technologies, (49-58)
- Kersting K An Inductive Logic Programming Approach to Statistical Relational Learning Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning, (1-228)
- Kulaš M (2005). Toward the Concept of Backtracking Computation, Electronic Notes in Theoretical Computer Science (ENTCS), 128:1, (39-59), Online publication date: 1-May-2005.
- Farré C, Teniente E and Urpí T (2005). Checking query containment with the CQC method, Data & Knowledge Engineering, 53:2, (163-223), Online publication date: 1-May-2005.
- Milnikel R (2005). Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, Annals of Mathematics and Artificial Intelligence, 44:1-2, (1-34), Online publication date: 1-May-2005.
- Guo H and Jayaraman B Mode-directed preferences for logic programs Proceedings of the 2005 ACM symposium on Applied computing, (1414-1418)
- Lu L Use of correctness assertions in declarative diagnosis Proceedings of the 2005 ACM symposium on Applied computing, (1404-1408)
- Gire F and Plourde C (2005). A New Partial Semantics for Disjunctive Deductive Databases, Fundamenta Informaticae, 67:4, (323-342), Online publication date: 1-Mar-2005.
- Brooks D, Erdem E, Minett J and Ringe D Character-Based cladistics and answer set programming Proceedings of the 7th international conference on Practical Aspects of Declarative Languages, (37-51)
- Yang P, Dong Y, Ramakrishnan C and Smolka S A provably correct compiler for efficient model checking of mobile processes Proceedings of the 7th international conference on Practical Aspects of Declarative Languages, (113-127)
- Yang G and Kifer M Inheritance in rule-based frame systems Journal on Data Semantics VII, (79-135)
- Hitzler P and Wendt M (2005). A uniform approach to logic programming semantics, Theory and Practice of Logic Programming, 5:1-2, (93-121), Online publication date: 1-Jan-2005.
- Wang H, Zhang M, Xu D and Zhang D (2004). A Framework of Fuzzy Diagnosis, IEEE Transactions on Knowledge and Data Engineering, 16:12, (1571-1582), Online publication date: 1-Dec-2004.
- Andrei Ş (2004). Counting for Satisfiability by Inverting Resolution, Artificial Intelligence Review, 22:4, (339-366), Online publication date: 1-Dec-2004.
- Wu J and Fecher H (2004). Symmetric structure in logic programming, Journal of Computer Science and Technology, 19:6, (803-811), Online publication date: 1-Nov-2004.
- Vanhoof W Searching semantically equivalent code fragments in logic programs Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation, (1-18)
- García-Díaz M and Nieva S Providing declarative semantics for extended constraint logic programs Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (55-66)
- Sawamura H and Mares E How agents should exploit tetralemma with an eastern mind in argumentation Proceedings of the 7th Pacific Rim international conference on Intelligent Agents and Multi-Agent Systems, (259-278)
- Leone N, Scarcello F and Subrahmanian V (2004). Optimal Models of Disjunctive Logic Programs, IEEE Transactions on Knowledge and Data Engineering, 16:4, (487-503), Online publication date: 1-Apr-2004.
- Caniupán M Handling inconsistencies in data warehouses Proceedings of the 2004 international conference on Current Trends in Database Technology, (166-176)
- Bertossi L and Schwind C (2004). Database Repairs and Analytic Tableaux, Annals of Mathematics and Artificial Intelligence, 40:1-2, (5-35), Online publication date: 1-Jan-2004.
- Biskup J and Bonatti P (2004). Controlled Query Evaluation for Known Policies by Combining Lying and Refusal, Annals of Mathematics and Artificial Intelligence, 40:1-2, (37-62), Online publication date: 1-Jan-2004.
- Lu L (2003). Path Dependent Analysis of Logic Programs, Higher-Order and Symbolic Computation, 16:4, (341-377), Online publication date: 1-Dec-2003.
- Cameron M, García de la Banda M, Marriott K and Moulder P ViMer Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, (56-66)
- De Raedt L and Kersting K (2003). Probabilistic logic learning, ACM SIGKDD Explorations Newsletter, 5:1, (31-48), Online publication date: 1-Jul-2003.
- Naish L Approximating the success set of logic programs using constrained regular types Proceedings of the 26th Australasian computer science conference - Volume 16, (61-67)
- d'Avila Garcez A, Lamb L and Gabbay D Neural-symbolic intuitionistic reasoning Design and application of hybrid intelligent systems, (399-408)
- Kowalski R and Clark K Logic programming Encyclopedia of Computer Science, (1017-1031)
- Minker J Deductive database Encyclopedia of Computer Science, (528-531)
- (2002). Logic, Optimization, and Constraint Programming, INFORMS Journal on Computing, 14:4, (295-321), Online publication date: 1-Nov-2002.
- Fioravanti F, Pettorossi A and Proietti M Combining logic programs and monadic second order logics by program transformation Proceedings of the 12th international conference on Logic based program synthesis and transformation, (160-181)
- Dix J, Kraus S and Subrahmanian V Agents dealing with time and uncertainty Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (912-919)
- Revoredo K and Zaverucha G Revision of first-order Bayesian classifiers Proceedings of the 12th international conference on Inductive logic programming, (223-237)
- Cumby C and Roth D Learning with feature description logics Proceedings of the 12th international conference on Inductive logic programming, (32-47)
- Laburthe F and Caseau Y (2002). SALSA, Constraints, 7:3/4, (255-288), Online publication date: 1-Jul-2002.
- Bonatti P and Olivetti N (2002). Sequent calculi for propositional nonmonotonic logics, ACM Transactions on Computational Logic, 3:2, (226-278), Online publication date: 1-Apr-2002.
- Lu L (2002). Path dependent analysis of logic programs, ACM SIGPLAN Notices, 37:3, (63-74), Online publication date: 1-Mar-2002.
- Lu L Path dependent analysis of logic programs Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (63-74)
- Leuschel M Homeomorphic embedding for online termination of symbolic methods The essence of computation, (379-403)
- Polkowski L and Skowron A Logic prespective on data and knowledge Handbook of data mining and knowledge discovery, (99-115)
- Garcez A, Russo A, Nuseibeh B and Kramer J An Analysis-Revision Cycle to Evolve Requirements Specifications Proceedings of the 16th IEEE international conference on Automated software engineering
- Bonatti P (2001). Resolution for Skeptical Stable Model Semantics, Journal of Automated Reasoning, 27:4, (391-421), Online publication date: 1-Nov-2001.
- Mazumdar S, Pietrzyk M and Chrysanthis P Caching constrained mobile data Proceedings of the tenth international conference on Information and knowledge management, (442-449)
- Bossi A, Cocco N and Rossi S Termination of well-typed logic programs Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (73-81)
- Bertino E, Bonatti P and Ferrari E (2001). TRBAC, ACM Transactions on Information and System Security, 4:3, (191-233), Online publication date: 1-Aug-2001.
- Reiser P and Riddle P (2001). Scaling Up Inductive Logic Programming, Applied Intelligence, 15:3, (181-197), Online publication date: 30-Jul-2001.
- Crampton J and Loizou G (2001). Authorisation and antichains, ACM SIGOPS Operating Systems Review, 35:3, (6-15), Online publication date: 1-Jul-2001.
- Bertino E, Catania B, Ferrari E and Perlasca P A logical framework for reasoning about access control models Proceedings of the sixth ACM symposium on Access control models and technologies, (41-52)
- Talbot J On the alternation-free horn µ-calculus Proceedings of the 7th international conference on Logic for programming and automated reasoning, (418-435)
- Gori R An abstract interpretation approach to termination of logic programs Proceedings of the 7th international conference on Logic for programming and automated reasoning, (362-380)
- Bonatti P, de Capitani di Vimercati S and Samarati P A modular approach to composing access control policies Proceedings of the 7th ACM conference on Computer and Communications Security, (164-173)
- Bonatti P and Samarati P Regulating service access and information release on the Web Proceedings of the 7th ACM conference on Computer and Communications Security, (134-143)
- Lu L A precise type analysis of logic programs Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, (214-225)
- Buccafurri F, Leone N and Rullo P (2000). Enhancing Disjunctive Datalog by Constraints, IEEE Transactions on Knowledge and Data Engineering, 12:5, (845-860), Online publication date: 1-Sep-2000.
- Ishikawa T, Numao M and Terano T Using domain knowledge in ILP to discover protein functional models Proceedings of the 6th Pacific Rim international conference on Artificial intelligence, (83-92)
- Bry F and Yahya A (2000). Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation, Journal of Automated Reasoning, 25:1, (35-82), Online publication date: 1-Jul-2000.
- Yoon S, Henschen L, Park E and Makki S Using domain knowledge in knowledge discovery Proceedings of the eighth international conference on Information and knowledge management, (243-250)
- Jaume M (1999). A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions, Journal of Automated Reasoning, 23:3, (347-371), Online publication date: 1-Nov-1999.
- Hölldobler S, Kalinke Y and Störr H (1999). Approximating the Semantics of Logic Programs by Recurrent Neural Networks, Applied Intelligence, 11:1, (45-58), Online publication date: 1-Jul-1999.
- Avila Garcez A and Zaverucha G (1999). The Connectionist Inductive Learning and Logic Programming System, Applied Intelligence, 11:1, (59-77), Online publication date: 1-Jul-1999.
- Bertino E, Ferrari E, Buccafurri F and Rullo P A Logical Framework for Reasoning on Data Access Control Policies Proceedings of the 12th IEEE workshop on Computer Security Foundations
- Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Srinivasan A (1999). A Study of Two Sampling Methods for Analyzing Large Datasets with ILP, Data Mining and Knowledge Discovery, 3:1, (95-123), Online publication date: 1-Mar-1999.
- Srinivasan A and King R (1999). Feature construction with Inductive Logic Programming, Data Mining and Knowledge Discovery, 3:1, (37-57), Online publication date: 1-Mar-1999.
- Gupta V, Jagadeesan R and Panangaden P Stochastic processes as concurrent constraint programs Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (189-202)
- Dovier A, Policriti A and Rossi G (1998). A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms, Fundamenta Informaticae, 36:2,3, (201-234), Online publication date: 1-Aug-1998.
- Leuschel M Logic Program Specialisation Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, (155-188)
- Corsini M and Rauzy A (1997). Toupie, Journal of Automated Reasoning, 19:2, (143-171), Online publication date: 1-Oct-1997.
- Kato S, Seki H and Itoh H A parallel implementation of cost-based abductive reasoning Proceedings of the second international symposium on Parallel symbolic computation, (111-118)
- Horváth T, Sloan R and Turán G Learning logic programs by using the product homomorphism method Proceedings of the tenth annual conference on Computational learning theory, (10-20)
- Lee S and Ling T Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases Proceedings of the 22th International Conference on Very Large Data Bases, (495-505)
- Liu C and Orgun M Executing specifications of distributed computations with Chronolog(MC) Proceedings of the 1996 ACM symposium on Applied Computing, (393-400)
- Yoon S, Song I and Park E Semantic query processing in object-oriented databases using deductive approach Proceedings of the fourth international conference on Information and knowledge management, (150-157)
- Noll T and Vogler H (1994). Top-Down Parsing With Simultaneous Evaluation Of Noncircular Attribute Grammars, Fundamenta Informaticae, 20:4, (285-332), Online publication date: 1-Dec-1994.
- Wang K and Yuan L (1994). First-Order Logic Characterization of Program Properties, IEEE Transactions on Knowledge and Data Engineering, 6:4, (518-533), Online publication date: 1-Aug-1994.
- Muggleton S Bayesian inductive logic programming Proceedings of the seventh annual conference on Computational learning theory, (3-11)
- Manwu X, Jianfeng L, Fancong Z and Jingwen D (1994). Agent language NUML and its reduction implementation model based on HOπ, ACM SIGPLAN Notices, 29:5, (41-48), Online publication date: 1-May-1994.
- Chang B, Choe K and Giacobazzi R Abstract filters Proceedings of the 1994 ACM symposium on Applied computing, (388-393)
- Johnson M (1994). Computing with features as formulae, Computational Linguistics, 20:1, (1-25), Online publication date: 1-Mar-1994.
- Weigert T and Tsai J (1994). A Computationally Tractable Nonmonotonic Logic, IEEE Transactions on Knowledge and Data Engineering, 6:1, (57-63), Online publication date: 1-Feb-1994.
- Muggleton S (1994). Inductive logic programming, ACM SIGART Bulletin, 5:1, (5-11), Online publication date: 1-Jan-1994.
- Lucas P (1993). Paper, Artificial Intelligence in Medicine, 5:5, (395-414), Online publication date: 1-Oct-1993.
- Beringer A and Hölldobler S On the adequateness of the connection method Proceedings of the eleventh national conference on Artificial intelligence, (9-14)
- Vadaparty K, Aslandogan Y and Ozsoyoglu G (1993). Towards a unified visual database access, ACM SIGMOD Record, 22:2, (357-366), Online publication date: 1-Jun-1993.
- Vadaparty K, Aslandogan Y and Ozsoyoglu G Towards a unified visual database access Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (357-366)
- Codish M, Debray S and Giacobazzi R Compositional analysis of modular logic programs Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (451-464)
- Bossi A, Bugliesi M, Gabbrielli M, Levi G and Meo M Differential logic programming Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (359-370)
- Kim M and Maida A (1993). Reliability Measure Theory, IEEE Transactions on Knowledge and Data Engineering, 5:1, (41-51), Online publication date: 1-Feb-1993.
- Tsai J, Weigert T and Jang H (1992). A Hybrid Knowledge Representation as a Basis of Requirement Specification and Specification Analysis, IEEE Transactions on Software Engineering, 18:12, (1076-1100), Online publication date: 1-Dec-1992.
- Peuschel B and Schäfer W Concepts and implementation of a rule-based process engine Proceedings of the 14th international conference on Software engineering, (262-279)
- Bsaïes K A strategy for transforming generate and test logic programs Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, (563-572)
- Warren D (1992). Memoing for logic programs, Communications of the ACM, 35:3, (93-111), Online publication date: 1-Mar-1992.
- Conrad S and Gogolla M (1992). An annotated bibliography on object-orientation and deduction, ACM SIGMOD Record, 21:1, (123-132), Online publication date: 1-Mar-1992.
- Barbuti R, Codish M, Giacobazzi R and Levi G Modelling Prolog control Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (95-104)
- Goguen J and Burstall R (1992). Institutions: abstract model theory for specification and programming, Journal of the ACM, 39:1, (95-146), Online publication date: 2-Jan-1992.
- Narain S An axiomatic basis for general discrete-event modeling Proceedings of the 23rd conference on Winter simulation, (1073-1082)
- Wilk M Equate Conference proceedings on Object-oriented programming systems, languages, and applications, (286-298)
- Cortesi A and Filé G (1991). Abstract interpretation of logic programs, ACM SIGPLAN Notices, 26:9, (52-61), Online publication date: 1-Sep-1991.
- Nakano M Constraint projection Proceedings of the 29th annual meeting on Association for Computational Linguistics, (307-314)
- Cortesi A and Filé G Abstract interpretation of logic programs Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (52-61)
- Chen Q and Kambayashi Y (1991). Nested relation based database knowledge representation, ACM SIGMOD Record, 20:2, (328-337), Online publication date: 1-Apr-1991.
- Lou Y and Ozsoyoglu Z (1991). LLO, ACM SIGMOD Record, 20:2, (198-207), Online publication date: 1-Apr-1991.
- Chen Q and Kambayashi Y Nested relation based database knowledge representation Proceedings of the 1991 ACM SIGMOD international conference on Management of data, (328-337)
- Lou Y and Ozsoyoglu Z LLO Proceedings of the 1991 ACM SIGMOD international conference on Management of data, (198-207)
- Mendelzon A and Wood P (1991). Functional dependencies in Horn clause queries, ACM Transactions on Database Systems, 16:1, (31-55), Online publication date: 1-Mar-1991.
- Narain S and Rothenberg J Proving temporal properties of hybrid systems Proceedings of the 22nd conference on Winter simulation, (250-256)
- Degl'Innocenti M, Ferrari G, Pacini G and Turini F (1990). RSF, IEEE Transactions on Software Engineering, 16:11, (1235-1246), Online publication date: 1-Nov-1990.
- Orman L Knowledge base architecture Proceedings of the 1990 ACM SIGBDP conference on Trends and directions in expert systems, (325-336)
- Shao J, Bell D and Hull M An experimental performance study of a pipelined recursive query processing strategy Proceedings of the second international symposium on Databases in parallel and distributed systems, (30-43)
- Kanellakis P, Kuper G and Revesz P Constraint query languages (preliminary report) Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (299-313)
- Prather R (1990). The relation of Lorenzen calculus to formal language theory, ACM SIGSAM Bulletin, 24:2, (9-18), Online publication date: 1-Apr-1990.
- Choppy C and Kaplan S Mixing abstract and concrete modules: specification, development and prototyping Proceedings of the 12th international conference on Software engineering, (173-184)
- Mayfield B and Baird T STP: a simple theorem prover for IBM-PC compatible computers Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems, (98-105)
- Roach D and Berghel H The physiology of PROLOG expert system inference engine Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems, (1-5)
- Radensky A (1990). Toward integration of the imperative and logic programming paradigms: Horn-clause programming in the Pascal environment, ACM SIGPLAN Notices, 25:2, (25-34), Online publication date: 1-Feb-1990.
- Sakai K and Aiba A (1989). CAL, Journal of Symbolic Computation, 8:6, (589-603), Online publication date: 1-Dec-1989.
- Saraswat V and Rinard M Concurrent constraint programming Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (232-245)
- Dahlgren K, McDowell J and Stabler E (1989). Knowledge representation for commonsense reasoning with text, Computational Linguistics, 15:3, (149-170), Online publication date: 1-Sep-1989.
- Troy D, Yu C and Zhang W (1989). Linearization of Nonlinear Recursive Rules, IEEE Transactions on Software Engineering, 15:9, (1109-1119), Online publication date: 1-Sep-1989.
- Schend B A sequential view of AND-parallelism through partial AND-processes Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1, (163-169)
- Dong G On distributed processibility of datalog queries by decomposing databases Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (26-35)
- Dong G (1989). On distributed processibility of datalog queries by decomposing databases, ACM SIGMOD Record, 18:2, (26-35), Online publication date: 1-Jun-1989.
- Ringwood G (1989). SLD: a folk acronym?, ACM SIGPLAN Notices, 24:5, (71-75), Online publication date: 1-May-1989.
- Manchanda S Declarative expression of deductive database updates Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (93-100)
- Bry F Logic programming as constructivism: a formalization and its application to databases Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (34-50)
- Przymusinski T Every logic program has a natural stratification and an iterated least fixed point model Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (11-21)
- Nussbaum M An interpreter for large knowledge bases Proceedings of the 17th conference on ACM Annual Computer Science Conference, (87-97)
- Peterka G and Murata T (1989). Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs, IEEE Transactions on Software Engineering, 15:2, (209-217), Online publication date: 1-Feb-1989.
- Baudinet M Temporal logic programming is complete and expressive Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (267-280)
- Rougemont M Fixed-point semantics and the representation of algorithms on large data Proceedings of the 14th International Conference on Very Large Data Bases, (264-272)
- Sripada S A logical framework for temporal deductive databases Proceedings of the 14th International Conference on Very Large Data Bases, (171-182)
- Debray S (1988). Unfold/fold transformations and loop optimization of logic programs, ACM SIGPLAN Notices, 23:7, (297-307), Online publication date: 1-Jul-1988.
- Abiteboul S and Hull R (1988). Data functions, datalog and negation, ACM SIGMOD Record, 17:3, (143-153), Online publication date: 1-Jun-1988.
- Debray S Unfold/fold transformations and loop optimization of logic programs Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (297-307)
- Abiteboul S and Hull R Data functions, datalog and negation Proceedings of the 1988 ACM SIGMOD international conference on Management of data, (143-153)
- Murata T and Zhang D (1988). A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs, IEEE Transactions on Software Engineering, 14:4, (481-497), Online publication date: 1-Apr-1988.
- Naqvi S and Krishnamurthy R Database updates in logic programming Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (251-262)
- Van Gelder A, Ross K and Schlipf J Unfounded sets and well-founded semantics for general logic programs Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (221-230)
- Imielinski T and Naqvi S Explicit control of logic programs through rule algebra Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (103-116)
- Ramakrishnan R, Beeri C and Krishnamurthy R Optimizing existential datalog queries Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (89-102)
- Shmueli O, Tsur S and Zaniolo C Rewriting of rules containing set terms in a logic data language LDL Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (15-28)
- Gordon T Oblog-2: A hybrid knowledge representation system for defeasible reasoning Proceedings of the 1st international conference on Artificial intelligence and law, (231-239)
- Zhang W and Yu C (1987). A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule, ACM SIGMOD Record, 16:3, (345-356), Online publication date: 1-Dec-1987.
- Zhang W and Yu C A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule Proceedings of the 1987 ACM SIGMOD international conference on Management of data, (345-356)
- Saraswat V The concurrent logic programming language CP: Definition and operational semantics Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (49-62)
- Kowalski R, Sadri F and Soper P Integrity Checking in Deductive Databases Proceedings of the 13th International Conference on Very Large Data Bases, (61-69)
- Barklund J (1987). Efficient interpretation of Prolog programs, ACM SIGPLAN Notices, 22:7, (132-137), Online publication date: 1-Jul-1987.
- Barklund J Efficient interpretation of Prolog programs Papers of the Symposium on Interpreters and interpretive techniques, (132-137)
- Beeri C and Ramakrishnan R On the power of magic Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (269-284)
- Shmueli O Decidability and expressiveness aspects of logic queries Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (237-249)
- Beeri C, Naqvi S, Ramakrishnan R, Shmueli O and Tsur S Sets and negation in a logic data base language (LDL1) Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (21-37)
- Abhyankar R and Baharam N Logic programming in LISP with controlled search (abstract only) Proceedings of the 15th annual conference on Computer Science
- Jernigan R and Eisner A A generalised data base interface for APL Proceedings of the international conference on APL, (158-163)
- Tsur S and Zaniolo C LDL Proceedings of the 12th International Conference on Very Large Data Bases, (33-41)
- Jernigan R and Eisner A (1986). A generalised data base interface for APL, ACM SIGAPL APL Quote Quad, 16:4, (158-163), Online publication date: 1-May-1986.
- Mendelzon A Functional dependencies in logic programs Proceedings of the 11th international conference on Very Large Data Bases - Volume 11, (324-330)
- Bidoit N and Hull R Positivism vs minimalism in deductive databases Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, (123-132)
Index Terms
- Foundations of logic programming
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Type-theoretic foundations for concurrent object-oriented programing
A number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = λ-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent ...
Type-theoretic foundations for concurrent object-oriented programing
OOPSLA '94: Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applicationsA number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = λ-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent ...