Conferences in DBLP
John Alan Robinson Computational Logic: Memories of the Past and Challenges for the Future. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1-24 [Conf ] David Page ILP: Just Do It. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:25-40 [Conf ] Melvin Fitting Databases and Higher Types. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:41-52 [Conf ] Krzysztof R. Apt A Denotational Semantics for First-Order Logic. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:53-69 [Conf ] David Poole Logic, Knowledge Representation, and Bayesian Decision Theory. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:70-86 [Conf ] David Lacey , Julian Richardson , Alan Smaill Logic Program Synthesis in a Higher-Order Setting. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:87-100 [Conf ] Michael Leuschel , Helko Lehmann Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:101-115 [Conf ] Jan Hruza , Petr Stepánek Binary Speed Up for Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:116-130 [Conf ] Daniel Cabeza Gras , Manuel V. Hermenegildo A New Module System for Prolog. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:131-148 [Conf ] José Júlio Alferes , Heinrich Herre , Luís Moniz Pereira Partial Models of Extended Generalized Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:149-163 [Conf ] Kewen Wang , Lizhu Zhou , Fangzhen Lin Alternating Fixpoint Theory for Logic Programs with Priority. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:164-178 [Conf ] Francisco Javier López-Fraguas , Jaime Sánchez-Hernández Proving Failure in Functional Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:179-193 [Conf ] Annalisa Bossi , Sandro Etalle , Sabina Rossi Semantics of Input-Consuming Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:194-208 [Conf ] Michael J. Maher A Denotational Semantics of Defeasible Logic. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:209-222 [Conf ] Kung-Kiu Lau , Mario Ornaghi Isoinitial Semantics for Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:223-238 [Conf ] Dale Miller Abstract Syntax for Variable Binders: An Overview. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:239-253 [Conf ] James Harland , Tatjana Lutovac , Michael Winikoff Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:254-268 [Conf ] Yoshitaka Kameya , Taisuke Sato Efficient EM Learning with Tabulation for Parameterized Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:269-284 [Conf ] Reiner Hähnle , Ryuzo Hasegawa , Yasuyuki Shirai Moder Generation Theorem Proving with Finite Interval Constraints. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:285-299 [Conf ] Rachid Echahed , Wendelin Serwe Combining Mobile Processes and Declarative Programming. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:300-314 [Conf ] Ben Curry , Geraint A. Wiggins , Gillian Hayes Representing Trees with Constraints. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:315-325 [Conf ] Denys Duchier , Joachim Niehren Dominance Constraints with Set Operators. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:326-341 [Conf ] Petra Hofstedt Better Communication for Tighter Cooperation. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:342-358 [Conf ] Rosella Gennari Arc Consistency Algorithms via Iterations of Subsumed Functions. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:358-372 [Conf ] Gilles Audemard , Belaid Benhamou , Pierre Siegel AVAL: An Enumerative Method for SAT. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:373-383 [Conf ] Ulf Nilsson , Johan Lübcke Constraint Logic Programming for Local and Symbolic Model-Checking. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:384-398 [Conf ] Arnaud Gotlieb , Bernard Botella , Michel Rueher A CLP Framework for Computing Structural Test Data. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:399-413 [Conf ] Francisco Azevedo , Pedro Barahona Modelling Digital Circuits Problems with Set Constraints. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:414-428 [Conf ] Tobias Müller Promoting Constraints to First-Class Status. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:429-447 [Conf ] Kit-ying Hui , Peter M. D. Gray Developing Finite Domain Constraints - A Data Model Approach. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:448-462 [Conf ] David Gilbert , Catuscia Palamidessi Concurrent Constraint Programming with Process Mobility. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:463-477 [Conf ] Baoqiu Cui , David Scott Warren A System for Tabled Constraint Logic Programming. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:478-492 [Conf ] Edgar Altamirano , Gonzalo Escalada-Imaz Finding Tractable Formulas in NNF. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:493-507 [Conf ] Peter Baumgartner , Fabio Massacci The Taming of the (X)OR. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:508-522 [Conf ] Regimantas Pliuskevicius On an omega -Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:523-537 [Conf ] Marco Benini Representing Object Code. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:538-552 [Conf ] Tommi A. Junttila , Ilkka Niemelä Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:553-567 [Conf ] Dexter Kozen , Maria-Christina Patron Certification of Compiler Optimizations Using Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:568-582 [Conf ] Michael Dierkes An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:583-597 [Conf ] Supratik Mukhopadhyay , Andreas Podelski Model Checking for Timed Logic Processes. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:598-612 [Conf ] Alberto Pettorossi , Maurizio Proietti Perfect Model Checking via Unfold/Fold Transformations. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:613-628 [Conf ] Richard J. Boulton , Konrad Slind Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:629-643 [Conf ] Erica Melis , Andreas Meier Proof Planning with Multiple Strategies. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:644-659 [Conf ] Paliath Narendran , Michaël Rusinowitch The Theory of Total Unary RPO Is Decidable. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:660-672 [Conf ] Zbigniew Lonc , Miroslaw Truszczynski On the Problem of Computing the Well-Founded Semantics. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:673-687 [Conf ] David Pearce , Inman P. de Guzmán , Agustín Valverde Computing Equilibrium Models Using Signed Formulas. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:688-702 [Conf ] Marc Denecker Extending Classical Logic with Inductive Definitions. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:703-717 [Conf ] Katsumi Inoue A Simple Characterization of Extended Abduction. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:718-732 [Conf ] Hans-Peter Störr , Michael Thielscher A New Equational Foundation for the Fluent Calculus. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:733-746 [Conf ] Steffen Hölldobler , Hans-Peter Störr Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:747-761 [Conf ] Helko Lehmann , Michael Leuschel Decidability Results for the Propositional Fluent Calculus. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:762-776 [Conf ] Vincenzo Pallotta A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:777-791 [Conf ] Phan Minh Dung , Tran Cao Son Default Reasoning with Specificity. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:792-806 [Conf ] Thomas Eiter , Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres Planning under Incomplete Knowledge. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:807-821 [Conf ] Esra Erdem , Vladimir Lifschitz , Martin D. F. Wong Wire Routing and Satisfiability Planning. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:822-836 [Conf ] Tommi Syrjänen Including Diagnostic Information in Configuration Models. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:837-851 [Conf ] Tomi Janhunen Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:852-866 [Conf ] Michael I. Dekhtyar , Alexander Ja. Dikovsky , Sergey Dudakov On Complexity of Updates through Integrity Constraints. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:867-881 [Conf ] Chitta Baral , Le-Chi Tuan , Raul Trejo , Vladik Kreinovich Computational Complexity of Planning Based on Partial Information about the System's Present and Past States. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:882-896 [Conf ] Yves Moinard , Raymond Rolland Smallest Equivalent Sets for Finite Propositional Formula Circumscription. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:897-911 [Conf ] Jan Broersen , Roel Wieringa , John-Jules Ch. Meyer A Semantics for Persistency in Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:912-925 [Conf ] Marcelo Arenas , Leopoldo E. Bertossi , Michael Kifer Applications of Annotated Predicate Calculus to Querying Inconsistent Databases. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:926-941 [Conf ] Alexander Celle , Leopoldo E. Bertossi Querying Inconsistent Databases: Algorithms and Implementation. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:942-956 [Conf ] Francesco Bonchi , Fosca Giannotti , Dino Pedreschi On Verification in Logic Database Languages. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:957-971 [Conf ] Yves Bastide , Nicolas Pasquier , Rafik Taouil , Gerd Stumme , Lotfi Lakhal Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:972-986 [Conf ] Rada Chirkova , Michael R. Genesereth Linearly Bounded Reformulations of Conjunctive Databases. [Citation Graph (1, 0)][DBLP ] Computational Logic, 2000, pp:987-1001 [Conf ] Paolo Mancarella , Gianluca Nerbini , Alessandra Raffaetà , Franco Turini MuTACLP: A Language for Declarative GIS Analysis. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1002-1016 [Conf ] Vitaliy L. Khizder , David Toman , Grant E. Weddell Reasoning about Duplicate Elimination with Description Logic. [Citation Graph (1, 0)][DBLP ] Computational Logic, 2000, pp:1017-1032 [Conf ] Sébastien Ferré , Olivier Ridoux A File System Based on Concept Analysis. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1033-1047 [Conf ] Enrico Franconi , Fabio Grandi , Federica Mandreoli A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1048-1062 [Conf ] Stefan Brass SLDMagic - The Real Magic (With Applications to Web Queries). [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1063-1077 [Conf ] Guizhen Yang , Michael Kifer FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1078-1093 [Conf ] Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan Design and Implementation of the Physical Layer in WebBases: The XRover Experience. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1094-1105 [Conf ] James Bailey , Alexandra Poulovassilis , Peter Newson A Dynamic Approach to Termination Analysis for Active Database Rules. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1106-1120 [Conf ] Saumya K. Debray , Timothy J. Hickey Constraint-Based Termination Analysis for Cyclic Active Database Rules. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1121-1136 [Conf ] Geert Jan Bex , Sebastian Maneth , Frank Neven A Formal Model for an Expressive Fragment of XSLT. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1137-1151 [Conf ] Peter T. Wood On the Equivalence of XML Patterns. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1152-1166 [Conf ] Barbara Oliboni , Letizia Tanca Querying XML Specified WWW Sites: Links and Recursion in XML-GL. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1167-1181 [Conf ] Seung Jin Lim , Yiu-Kai Ng A Heuristic Approach for Converting HTML Documents to XML Documents. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1182-1196 [Conf ] Laurent Allain , Pascal Yim Specification of an Active Database System Application Using Dynamic Relation Nets. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1197-1209 [Conf ] Mutsumi Nakamura , Chitta Baral Invariance, Maintenance, and Other Declarative Objectives of Triggers - A Formal Characterization of Active Databases. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1210-1224 [Conf ] Paul Tarau Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1225-1239 [Conf ] Bart Demoen , Phuong-Lan Nguyen So Many WAM Variations, So Little Time. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1240-1254 [Conf ] Nancy Mazur , Gerda Janssens , Maurice Bruynooghe A Module Based Analysis for Memory Reuse in Mercury. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1255-1269 [Conf ] Maria J. García de la Banda , Peter J. Stuckey , Warwick Harvey , Kim Marriott Model Checking in HAL. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1270-1284 [Conf ] Inês de Castro Dutra , Vítor Santos Costa , Ricardo Bianchini The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1285-1299 [Conf ] Steve Barker Data Protection by Logic Programming. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1300-1314 [Conf ] Chuck Liang A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1315-1329 [Conf ] Pablo Gervás A Logic Programming Application for the Analysis of Spanish Verse. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1330-1344 [Conf ] Manuel V. Hermenegildo A Documentation Generator for (C)LP Systems. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1345-1361 [Conf ] Joseph Gartner , Terrance Swift , Allen Tien , Carlos Viegas Damásio , Luís Moniz Pereira Psychiatric Diagnosis from the Viewpoint of Computational Logic. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1362-1376 [Conf ]