Proceedings of the First International Conference on Computational Logic
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

John W. Lloyd, Verónica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, Peter J. Stuckey
Proceedings of the First International Conference on Computational Logic
CL, 2000.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{CL-2000,
	address       = "London, England, United Kingdom",
	editor        = "John W. Lloyd and Verónica Dahl and Ulrich Furbach and Manfred Kerber and Kung-Kiu Lau and Catuscia Palamidessi and Luís Moniz Pereira and Yehoshua Sagiv and Peter J. Stuckey",
	isbn          = "3-540-67797-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the First International Conference on Computational Logic}",
	volume        = 1861,
	year          = 2000,
}

Event page: http://www.doc.ic.ac.uk/cl2000/

Contents (91 items)

CL-2000-Robinson #challenge #logic
Computational Logic: Memories of the Past and Challenges for the Future (JAR), pp. 1–24.
CL-2000-Page #named
ILP: Just Do It (DP), pp. 25–40.
CL-2000-Fitting #database
Databases and Higher Types (MF), pp. 41–52.
CL-2000-Apt #first-order #logic #semantics
A Denotational Semantics for First-Order Logic (KRA), pp. 53–69.
CL-2000-Poole #information management #logic #representation
Logic, Knowledge Representation, and Bayesian Decision Theory (DP), pp. 70–86.
CL-2000-LaceyRS #higher-order #logic programming #synthesis
Logic Program Synthesis in a Higher-Order Setting (DL, JR, AS), pp. 87–100.
CL-2000-LeuschelL #deduction #petri net
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
CL-2000-HruzaS #logic programming #source code
Binary Speed Up for Logic Programs (JH, PS), pp. 116–130.
CL-2000-GrasH #prolog
A New Module System for Prolog (DCG, MVH), pp. 131–148.
CL-2000-AlferesHP #logic programming #modelling #source code
Partial Models of Extended Generalized Logic Programs (JJA, HH, LMP), pp. 149–163.
CL-2000-WangZL #fixpoint #logic programming #source code
Alternating Fixpoint Theory for Logic Programs with Priority (KW, LZ, FL), pp. 164–178.
CL-2000-Lopez-FraguasH #functional #logic programming #proving #source code
Proving Failure in Functional Logic Programs (FJLF, JSH), pp. 179–193.
CL-2000-BossiER #logic programming #semantics #source code
Semantics of Input-Consuming Logic Programs (AB, SE, SR), pp. 194–208.
CL-2000-Maher #logic #semantics
A Denotational Semantics of Defeasible Logic (MJM), pp. 209–222.
CL-2000-LauO #logic programming #semantics #source code
Isoinitial Semantics for Logic Programs (KKL, MO), pp. 223–238.
CL-2000-Miller #overview #perspective #syntax
Abstract Syntax for Variable Binders: An Overview (DM), pp. 239–253.
CL-2000-HarlandLW #logic #multi #proving
Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic (JH, TL, MW), pp. 254–268.
CL-2000-KameyaS #learning #logic programming #performance #source code
Efficient EM Learning with Tabulation for Parameterized Logic Programs (YK, TS), pp. 269–284.
CL-2000-HahnleHS #constraints #finite #generative #proving #theorem proving
Moder Generation Theorem Proving with Finite Interval Constraints (RH, RH, YS), pp. 285–299.
CL-2000-EchahedS #declarative #mobile #process #programming
Combining Mobile Processes and Declarative Programming (RE, WS), pp. 300–314.
CL-2000-CurryWH #constraints #representation
Representing Trees with Constraints (BC, GAW, GH), pp. 315–325.
CL-2000-DuchierN #constraints #set
Dominance Constraints with Set Operators (DD, JN), pp. 326–341.
CL-2000-Hofstedt #communication
Better Communication for Tighter Cooperation (PH), pp. 342–358.
CL-2000-Gennari #algorithm #consistency
Arc Consistency Algorithms via Iterations of Subsumed Functions (RG), pp. 358–372.
CL-2000-AudemardBS #named #satisfiability
AVAL: An Enumerative Method for SAT (GA, BB, PS), pp. 373–383.
CL-2000-NilssonL #constraints #logic programming #model checking
Constraint Logic Programming for Local and Symbolic Model-Checking (UN, JL), pp. 384–398.
CL-2000-GotliebBR #framework #testing
A CLP Framework for Computing Structural Test Data (AG, BB, MR), pp. 399–413.
CL-2000-AzevedoB #constraints #modelling #problem #set
Modelling Digital Circuits Problems with Set Constraints (FA, PB), pp. 414–428.
CL-2000-Muller #constraints
Promoting Constraints to First-Class Status (TM), pp. 429–447.
CL-2000-HuiG #approach #constraints #finite
Developing Finite Domain Constraints — A Data Model Approach (KyH, PMDG), pp. 448–462.
CL-2000-GilbertP #concurrent #constraints #process #programming
Concurrent Constraint Programming with Process Mobility (DRG, CP), pp. 463–477.
CL-2000-CuiW #constraints #logic programming
A System for Tabled Constraint Logic Programming (BC, DSW), pp. 478–492.
CL-2000-AltamiranoE
Finding Tractable Formulas in NNF (EA, GEI), pp. 493–507.
CL-2000-BaumgartnerM
The Taming of the (X)OR (PB, FM), pp. 508–522.
CL-2000-Pliuskevicius #deduction #on the #strict
On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.
CL-2000-Benini #representation
Representing Object Code (MB), pp. 538–552.
CL-2000-JunttilaN #performance #satisfiability #towards
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking (TAJ, IN), pp. 553–567.
CL-2000-KozenP #algebra #certification #compilation #optimisation #testing #using
Certification of Compiler Optimizations Using Kleene Algebra with Tests (DK, MCP), pp. 568–582.
CL-2000-Dierkes
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas (MD), pp. 583–597.
CL-2000-MukhopadhyayP #logic #model checking #process
Model Checking for Timed Logic Processes (SM, AP), pp. 598–612.
CL-2000-PettorossiP #model checking
Perfect Model Checking via Unfold/Fold Transformations (AP, MP), pp. 613–628.
CL-2000-BoultonS #automation #induction #recursion
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions (RJB, KS), pp. 629–643.
CL-2000-MelisM #multi #proving #theorem proving
Proof Planning with Multiple Strategies (EM, AM), pp. 644–659.
CL-2000-NarendranR #decidability #formal method
The Theory of Total Unary RPO Is Decidable (PN, MR), pp. 660–672.
CL-2000-LoncT #on the #problem #semantics
On the Problem of Computing the Well-Founded Semantics (ZL, MT), pp. 673–687.
CL-2000-PearceGV #equilibrium #modelling #using
Computing Equilibrium Models Using Signed Formulas (DP, IPdG, AV), pp. 688–702.
CL-2000-Denecker #induction #logic
Extending Classical Logic with Inductive Definitions (MD), pp. 703–717.
CL-2000-Inoue #abduction
A Simple Characterization of Extended Abduction (KI), pp. 718–732.
CL-2000-StorrT #calculus #equation
A New Equational Foundation for the Fluent Calculus (HPS, MT), pp. 733–746.
CL-2000-HolldoblerS #calculus #diagrams #problem #using
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.
CL-2000-LehmannL #calculus #decidability
Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
CL-2000-Pallotta #composition #logic #logic programming #semantics #source code
A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs (VP), pp. 777–791.
CL-2000-DungS #reasoning
Default Reasoning with Specificity (PMD, TCS), pp. 792–806.
CL-2000-EiterFLPP #information management
Planning under Incomplete Knowledge (TE, WF, NL, GP, AP), pp. 807–821.
CL-2000-ErdemLW #satisfiability
Wire Routing and Satisfiability Planning (EE, VL, MDFW), pp. 822–836.
CL-2000-Syrjanen #modelling
Including Diagnostic Information in Configuration Models (TS), pp. 837–851.
CL-2000-Janhunen #logic programming #source code #strict
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.
CL-2000-DekhtyarDD #complexity #constraints #on the
On Complexity of Updates through Integrity Constraints (MID, AJD, SD), pp. 867–881.
CL-2000-BaralTTK #complexity
Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States (CB, LCT, RT, VK), pp. 882–896.
CL-2000-MoinardR #finite #set
Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
CL-2000-BroersenWM #logic #semantics
A Semantics for Persistency in Propositional Dynamic Logic (JMB, RW, JJCM), pp. 912–925.
CL-2000-ArenasBK #calculus #consistency #database #query
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases (MA, LEB, MK), pp. 926–941.
CL-2000-CelleB #algorithm #consistency #database #implementation #query
Querying Inconsistent Databases: Algorithms and Implementation (AC, LEB), pp. 942–956.
CL-2000-BonchiGP #database #logic #on the #verification
On Verification in Logic Database Languages (FB, FG, DP), pp. 957–971.
CL-2000-BastidePTSL #mining #using
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (YB, NP, RT, GS, LL), pp. 972–986.
CL-2000-ChirkovaG #bound #database
Linearly Bounded Reformulations of Conjunctive Databases (RC, MRG), pp. 987–1001.
CL-2000-MancarellaNRT #analysis #declarative #named
MuTACLP: A Language for Declarative GIS Analysis (PM, GN, AR, FT), pp. 1002–1016.
CL-2000-KhizderTW #logic #reasoning
Reasoning about Duplicate Elimination with Description Logic (VLK, DT, GEW), pp. 1017–1032.
CL-2000-FerreR #concept analysis #file system
A File System Based on Concept Analysis (SF, OR), pp. 1033–1047.
CL-2000-FranconiGM #approach #database #evolution #object-oriented #semantics #version control
A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases (EF, FG, FM), pp. 1048–1062.
CL-2000-Brass #named #query #web
SLDMagic — The Real Magic (With Applications to Web Queries) (SB), pp. 1063–1077.
CL-2000-YangK #implementation #logic #named #performance #using
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine (GY, MK), pp. 1078–1093.
CL-2000-DavulcuYKR #design #experience #implementation #physics
Design and Implementation of the Physical Layer in WebBases: The XRover Experience (HD, GY, MK, IVR), pp. 1094–1105.
CL-2000-BraileyPN #analysis #approach #database #termination
A Dynamic Approach to Termination Analysis for Active Database Rules (JB, AP, PN), pp. 1106–1120.
CL-2000-DebrayH #analysis #constraints #database #termination
Constraint-Based Termination Analysis for Cyclic Active Database Rules (SKD, TJH), pp. 1121–1136.
CL-2000-BexMN #formal method
A Formal Model for an Expressive Fragment of XSLT (GJB, SM, FN), pp. 1137–1151.
CL-2000-Wood #equivalence #on the #xml
On the Equivalence of XML Patterns (PTW), pp. 1152–1166.
CL-2000-OliboniT #query #recursion #xml
Querying XML Specified WWW Sites: Links and Recursion in XML-GL (BO, LT), pp. 1167–1181.
CL-2000-LimN #approach #documentation #heuristic #html #xml
A Heuristic Approach for Converting HTML Documents to XML Documents (SJL, YKN), pp. 1182–1196.
CL-2000-AllainY #database #specification #using
Specification of an Active Database System Application Using Dynamic Relation Nets (LA, PY), pp. 1197–1209.
CL-2000-NakamuraB #database #declarative #maintenance
Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases (MN, CB), pp. 1210–1224.
CL-2000-Tarau #named #prolog #refactoring
Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects (PT), pp. 1225–1239.
CL-2000-DemoenN
So Many WAM Variations, So Little Time (BD, PLN), pp. 1240–1254.
CL-2000-MazurJB #analysis #memory management #reuse
A Module Based Analysis for Memory Reuse in Mercury (NM, GJ, MB), pp. 1255–1269.
CL-2000-BandaSHM #model checking
Model Checking in HAL (MJGdlB, PJS, WH, KM), pp. 1270–1284.
CL-2000-DutraCB #logic programming #parallel #protocol
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems (IdCD, VSC, RB), pp. 1285–1299.
CL-2000-Barker #logic programming
Data Protection by Logic Programming (SB), pp. 1300–1314.
CL-2000-Liang #generative #logic programming #parsing #programming language
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language (CL), pp. 1315–1329.
CL-2000-Gervas #analysis #logic programming
A Logic Programming Application for the Analysis of Spanish Verse (PG), pp. 1330–1344.
CL-2000-Hermenegildo #documentation #generative
A Documentation Generator for (C)LP Systems (MVH), pp. 1345–1361.
CL-2000-GartnerSTDP #logic
Psychiatric Diagnosis from the Viewpoint of Computational Logic (JG, TS, AT, CVD, LMP), pp. 1362–1376.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.