yusuke1997/dblp-id-title huggingface dataset:
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
A Relational Model of a Parallel and Non-deterministic lambda-Calculus
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
The Concurrency Complexity for the Horn Fragment of Linear Logic
A Modal BI Logic for Dynamic Resource Properties
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras
Complete Sequential Calculi for the First Order Symmetrical Linear Temporal Logic with Until and Since
A Safe Recursion Scheme for Exponential Time
Metastability and Higher-Order Computability
Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification
The Isomorphism Problem for FST Injection Structures
Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic
Soundness and Completeness Results for LEA and Probability Semantics
Weighted Distributed Systems and Their Logics
Assignment Calculus: A Pure Imperative Language
Interpolation Method for Multicomponent Sequent Calculi
ATL with Strategy Contexts and Bounded Memory
Correctness of Generic Modules
Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings
Recognition of Deductive Data Base Stability
Constructive Specifications of Abstract Data Types Using Temporal Logic
Allegories of Circuits
Belief Expansion in Subset Models
Definability in First Order Theories of Graph Orderings
Justified and Common Knowledge: Limited Conservativity
MSL - A Mathematical Specification Language
On Extreme Points of Convex Compact Turing Located Set
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
Intensionally Stable Functions
Ordering Optimizations for Concurrent Logic Programs
Intransitive Temporal Multi-agent's Logic, Knowledge and Uncertainty, Plausibility
Taming Modal Impredicativity: Superlazy Reduction
A Clausal Approach to Proof Analysis in Second-Order Logic
Separating the Fan Theorem and Its Weakenings II
Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines
Learning Small Programs with Additional Information
A Note on Extensions: Admissible Rules via Semantics
The Online Space Complexity of Probabilistic Languages
The Completeness Problem for Modal Logic
Weak Orthogonality Implies Confluence: The Higher Order Case
A Minimal Computational Theory of a Minimal Computational Universe
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
Logical Schemes for First-Order Theories
Uniform Circuits, & Boolean Proof Nets
A Logical Characterization of Asynchronously Communicating Agents
Parallel Feedback Turing Computability
Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings
Levy Labels and Recursive Types
Arity vs. Alternation in Second Order Logic
Justification Awareness Models
A Synthesis Algorithm for Hybrid Systems
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines
Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings
Self-referentiality in the Brouwer-Heyting-Kolmogorov Semantics of Intuitionistic Logic
Founded Semantics and Constraint Semantics of Logic Rules
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
Stuttering for Abstract Probabilistic Automata
Logical Foundations of Computer Science - International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings
An And-Parallelism Cooperative Scheme for Full Prolog Interpreters on a Transputer-Based Architecture
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Betwixt Turing and Kleene
The Intensional Lambda Calculus
Proof Identity for Classical Logic: Generalizing to Normality
Light Linear Logic with Controlled Weakening
Formal Verification of Logic Programs: Foundations and Implementation
A Decidable Temporal Logic of Repeating Values
Hyperarithmetical Worm Battles
Probabilistic Justification Logic
Gentzen-Style and Novikov-Style Cut-Elimination
Non Modularity and Expressibility for Nets of Relations
Modal Type Theory Based on the Intuitionistic Modal Logic $\mathbf{IEL}^{-}$
On Complexity of Ehrenfeucht-Fraïssé Games
Computational Hardness of Validity in Probability Logic
The Ehrenfeucht-Fraisse Games for Transitive Closure
Dialectica Logical Principles
Tableaux and Hypersequents for Justification Logic
Referential Data Structures and Labeled Modal Logic
A Sequent Calculus for a First Order Linear Temporal Logic with Equality
A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem
Many-Valued Non-Monotonic Modal Logics
Functions for the General Solution of Parametric Word Equations
Coalgebras and Approximation
Parameterised Complexity of Abduction in Schaefer's Framework
Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach
Including the Past in 'Topologic'
Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings
Sequential Calculus for Proving the Properties of Regular Programs
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Typed lamda-Calculus with Recursive Definitions
Provability Logic with Operations on Proofs
A Universal Algebra for the Variable-Free Fragment of $${\mathrm {RC}^\nabla }$$ RC ∇
Type Introduction for Equational Rewriting
Automated Deduction in Additive and Multiplicative Linear Logic
Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences
Games on Multi-stack Pushdown Systems
Unifying Sets and Programs via Dependent Types
Solving Equational Constraints in Polymorphic Types
Predicative Recurrence in Finite Types
Hereditarily Sequential Functionals
Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic
Existential Instantiation and Strong Normalization
Incremental Polymorphic Type Checking with Update
Partial Algebra + Order-Sorted Algebra = Galactic Algebra
From Epistemic Paradox to Doxastic Arithmetic
Lifting Recursive Counterexamples to Higher-Order Arithmetic
Parametric Church's Thesis: Synthetic Computability Without Choice
A Note on Rewriting Proofs and Fibonacci Numbers
Comparing Cubes
Density Elimination and Rational Completeness for First-Order Logics
Compositional Reasoning for Multi-modal Logics
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Multiplicative Linear Logic for Resource Transformation Nets
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily
Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings
Sub-computable Bounded Pseudorandomness
Towards Computing Distances Between Programs via Scott Domains
Multiple Conclusion Rules in Logics with the Disjunction Property
Conservativity for Logics of Justified Belief
Some Puzzles About Probability and Probabilistic Conditionals
Recursive Rules with Aggregation: A Simple Unified Semantics
Preserving of Admissible Inference Rules in Modal Logics
Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics
A Natural Proof System for Herbrand's Theorem
Compactness in the Theory of Continuous Automata
Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms
Fixed Point Theorems on Partial Randomness
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees
Preference Logics and Non-Monotonicity in Logic Programming
Capturing Bisimulation-Invariant Ptime
Realizations and LP
Denotations for Classical Proofs - Preliminary Results
On Model Checking Infinite-State Systems
Topological Semantics for Hybrid Systems
Automated Support for the Investigation of Paraconsistent and Other Logics
A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors
Type Theoretical Databases
Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
A Globally Sound Analytic Calculus for Henkin Quantifiers
Association Nets: an Alternative Formalization of Common Thinking
Feasibility of Finite and Infinite Paths in Data Dependent Programs
Balanced Formulas, BCK-Minimal Formulas and Their Proofs
Call-by-Value Non-determinism in a Linear Logic Type Discipline
Update as Evidence: Belief Expansion
Hypersequent Calculus for Intuitionistic Logic with Classical Atoms
Dialectica Categories for the Lambek Calculus
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets
Elementary Differential Calculus on Discrete and Hybrid Structures
Measure Quantifier in Monadic Second Order Logic
Machine Learning of Higher Order Programs
Compactness Properties for Stable Semantics of Logic Programs
The Wadge Hierarchy of Petri Nets ω -Languages
A Categorical Interpretation of Partial Function Logic and Hoare Logic
On Tolerance Analysis of Games with Belief Revision
An Interleaving Model for Real-Time Systems
A Cut-Free Labelled Sequent Calculus for Dynamic Epistemic Logic
The Urysohn Extension Theorem for Bishop Spaces
From Display to Labelled Proofs for Tense Logics
The Logic of Proofs as a Foundation for Certifying Mobile Computation
Models for the Logic of Proofs
Effective Operators and Continuity Revisited
Justifications, Awareness and Epistemic Dynamics
Propositional Dynamic Logic with Quantification over Regular Computation Sequences
Positive Fork Graph Calculus
Augmenting Subset Spaces to Cope with Multi-agent Knowledge
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic
On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces
Complexity of Query Answering in Logic Databases with Complex Values
A Unifying Theory of Dependent Types: The Schematic Approach
Explicit Generic Common Knowledge
Total Public Announcements
A Logic of Blockchain Updates
Multiplayer Cost Games with Simple Nash Equilibria
A Parameterized View on the Complexity of Dependence Logic
Basic Forward Chaining Construction for Logic Programs
On the Expressive Power of Modal Logics on Trees
Generic Queries over Quasy-o-minimal Domains
Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension
Classes with Pairwise Equivalent Enumerations
An Interval-Based Modal Logic for System Specification
Multiplexor Categories and Models of Soft Linear Logic
On Inverse Operators in Dynamic Epistemic Logic
Ordinal Arithmetic with List Structures
Temporalization of Probabilistic Propositional Logic
A Decidable Fragment of Second Order Linear Logic
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
Quasi-Characteristic Inference Rules for Modal Logics
Reasoning About Sequences of Memory States
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers
Knowledge of Uncertain Worlds: Programming with Logical Constraints
On Expressive Completeness of Modal Logic
Polyteam Semantics
The Logic of Uncertain Justifications
Verifying Balanced Trees
Towards a Theory of Recursive Structures (extended abstract)
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents
Quantifying the Amount of Verboseness
Games on Strings with a Limited Order Relation
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey
Propositional Linear Temporal Logic and Language Homomorphisms
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
Application of Typed Lambda Calculi in the Untyped Lambda Calculus
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction
Case Study: Additive Linear Logic and Lattices
Sequent Calculus for Intuitionistic Epistemic Logic IEL
On the Constructive Truth and Falsity in Peano Arithmetic
Probabilistic Reasoning About Simply Typed Lambda Terms
The Parameterized Complexity of Some Problems in Logic and Linguistics
Banishing Robust Turing Completeness
Some Results on Propositional Dynamic Logic with Fixed Points
Combinatorics and Representation Theory of Lie Superalgebras over Letterplace Superalgebras
Constructive Theory and Algorithm for Blending Several Implicit Algebraic Surfaces
Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers
The Newton Polygon Method for Differential Equations
Hybrid Matrix Geometric Algebra
On Averaging in Clifford Groups
Conic Sections and Meet Intersections in Geometric Algebra
Recent Applications of Conformal Geometric Algebra
Some Necessary Conditions on the Number of Solutions for the P4P Problem
Hamiltonian System and Algebro-Geometric Solution Associated with Dispersive Long Wave Equation
Intrinsic Differential Geometry with Geometric Calculus
n D Object Representation and Detection from Single 2D Line Drawing
Applications of Geometric Algebra in Robot Vision
A Generalization of Xie-Nie Stability Criterion
Polynomial General Solutions for First Order Autonomous ODEs
An Introduction to Logical Animation
Recent Methods for Reconstructing Surfaces from Multiple Images
Implicit Reduced Involutive Forms and Their Application to Engineering Multibody Systems
Invariant Geometric Motions of Space Curves
Applications of Conformal Geometric Algebra in Computer Vision and Graphics
On Miquel's Five-Circle Theorem
Polyhedral Scene Analysis Combining Parametric Propagation with Calotte Analysis
Twists - An Operational Representation of Shape
Formal Power Series and Loose Entry Formulas for the Dixon Matrix
A Survey of Moving Frames
Minimum-Cost Optimization in Multicommodity Logistic Chain Network
The Painlevé Test of Nonlinear Partial Differential Equations and Its Implementation Using Maple
Classification of Signature Curves Using Latent Semantic Analysis
Hybrid Method for Solving New Pose Estimation Equation System
On Wintner's Conjecture About Central Configurations
A Unified and Complete Framework of Invariance for Six Points
Parallel Query Processing with Heterogeneous Machines
Efficient reasoning about data trees via integer linear programming
Parallel skyline queries
Consistent Query Answering: Five Easy Pieces
Containment for XPath Fragments under DTD Constraints
Connecting Width and Structure in Knowledge Compilation
Logic and Databases: An Assessment
Practical Relational Calculus Query Evaluation
Optimizing Incremental Computation of Datalog Programs with Non-deterministic Semantics
Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings
Fine-Grained Complexity of Regular Path Queries
The Design Space of Type Checkers for XML Transformation Languages
Privacy in Database Publishing
Dynamic Complexity of Document Spanners
The Dynamic Complexity of Transitive Closure Is In DynTC 0
Commutativity Analysis in XML Update Languages
A Formal Study of Collaborative Access Control in Distributed Datalog
Incremental Evaluation of Datalog Queries
What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk)
Certain and possible XPath answers
Optimal Distributed Declustering Using Replication
On the complexity of query answering over incomplete XML documents
The Dynamic Two Phase Commitment (D2PC) Protocol
An Update on Dynamic Complexity Theory
Complexity of higher-order queries
Generating, sampling and counting subclasses of regular tree languages
Object-Oriented Database Evolution
Space Usage in Functional Query Languages
Incorporating User Preferences in Multimedia Queries
Streaming Enumeration on Nested Documents
Rewriting Guarded Existential Rules into Small Datalog Programs
On the Generation of 2-Dimensional Index Workloads
Methods and Problems in Data Mining
Asymptotic Conditional Probabilities for Conjunctive Queries
First-Order Query Rewriting for Inconsistent Databases
Front Matter, Table of Contents, Preface, Conference Organization, List of Authors
Increasing representational power and scaling reasoning in probabilistic databases
Toward a Structured Information Retrieval System on the Web: Automatic Structure Extraction of Web Pages
Extracting minimum-weight tree patterns from a schema with neighborhood constraints
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings
Expressiveness and Complexity of Active Databases
A Framework for Extraction and Transformation of Documents
Document Spanners: From Expressive Power to Decision Problems
Repairing Databases over Metric Spaces with Coincidence Constraints
New Rewritings and Optimizations for Regular Path Queries
Remaining CALM in Declarative Networking
Skyline Operators for Document Spanners
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
Efficient processing of 3-sided range queries with probabilistic guarantees
The complexity of evaluating tuple generating dependencies
Random Sampling and Size Estimation Over Cyclic Joins
Parallel Update Transactions (Extended Abstract)
Evaluating First-Order Formulas in Structured Graphs (Invited Talk)
Ranked Enumeration for MSO on Trees via Knowledge Compilation
Model and Verification of a Data Manager Based on ARIES
Detecting Ambiguity in Prioritized Database Repairing
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
Naturally Embedded Query Languages
On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products
Constant-Memory Validation of Streaming XML Documents Against DTDs
Answering UCQs under Updates and in the Presence of Integrity Constraints
Data on Air - What's in it for the Database Theorist
Dynamic Direct Access of MSO Query Evaluation over Strings
Reverse Prevention Sampling for Misinformation Mitigation in Social Networks
Algebraic Rewritings for Optimizing Regular Path Queries
Top-k Indexes Made Small and Sweet (Invited Talk)
Principles of Guarded Structural Indexing
Adding For-Loops to First-Order Logic
Optimal Allocation of Two-Dimensional Data
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion
A Relational Object Model
Containment of Aggregate Queries
A Framework for Estimating Stream Expression Cardinalities
A greedy algorithm for constructing a low-width generalized hypertree decomposition
ICDT'86, International Conference on Database Theory, Rome, Italy, September 8-10, 1986, Proceedings
GYM: A Multiround Distributed Join Algorithm
Recursive queries on trees and data trees
Unsolvable Problems Related To The View Integration Approach
27th International Conference on Database Theory, ICDT 2024, Paestum, Italy, March 25-28, 2024
Restructuring of Complex Objects and Office Forms
Weight Annotation in Information Extraction
On an Information Theoretic Approach to Cardinality Estimation (Invited Talk)
Highly expressive query languages for unordered data trees
On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds
25th International Conference on Database Theory, ICDT 2022, Edinburgh, UK (Virtual Conference), March 29 - April 1, 2022
Semantic Foundations of Equality Saturation
Some Positive Results for Boundedness of Multiple Recursive Rules
The Complexity of the Shapley Value for Regular Path Queries
24th International Conference on Database Theory, ICDT 2021, Nicosia, Cyprus, March 23-26, 2021
Knowledge compilation meets database theory: compiling queries to decision diagrams
Datalog ± : a unified approach to ontologies and integrity constraints
Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
Reconcilable differences
The average-case complexity of counting distinct elements
Two-Way Join Optimization in Partitioned Database Systems
A Family of Centrality Measures for Graph Data Based on Subgraphs
Scale Independence: Using Small Data to Answer Queries on Big Data (Invited Talk)
Containment of pattern-based queries over data trees
Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees
On Two Forms of Structural Recursion
A Closed Form for Datalog Queries with Integer Order
Mining for Empty Rectangles in Large Data Sets
Model-Theoretic Minimal Chenge Operators for Constraint Databases
Search Joins with the Web
Enumerating Subgraphs of Constant Sizes in External Memory
On Load Shedding in Complex Event Processing
Authorization Views and Conditional Query Containment
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying
Relative expressive power of navigational querying on graphs
How Database Theory Helps Teach Relational Queries in Database Education (Invited Talk)
Selection of Views to Materialize Under a Maintenance Cost Constraint
Query languages for data exchange: beyond unions of conjunctive queries
On provenance and privacy
The Pipelined Set Cover Problem
Approximate Data Exchange
Finding optimal probabilistic generators for XML collections
First Order Paths in Ordered Trees
Current Challenges in Graph Databases (Invited Talk)
On the Semantics of Rule-Based Expert Systems with Uncertainty
Enumeration of Minimal Hitting Sets Parameterized by Treewidth
Title, Table of Contents, Preface, ICDT 2015 Test of Time Award, Organization, External Reviewers, List of Authors
On the tradeoff between mapping and querying power in XML data exchange
Join Algorithms: From External Memory to the BSP
Computing Data Distribution from Query Selectivities
Generating Relations from XML Documents
On the aggregation problem for synthesized web services
Comparing Apples and Oranges: Fairness and Diversity in Ranking (Invited Talk)
Learning twig and path queries
Querying data sources that export infinite sets of views
A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs
Limits of Schema Mappings
A Formal Framework for Complex Event Processing
Deciding Correctness with Fairness for Simple Transducer Networks
Win-move is coordination-free (sometimes)
Run-time Management Policies for Data Intensive Web Sites
Hybrid Atomicity for Nested Transactions
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
A Declarative Framework for Linking Entities
A Semi-monad for Semi-structured Data
k-jump strategy for preserving privacy in micro-data disclosure
Optimal error of query sets under the differentially-private matrix mechanism
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
Answering non-monotonic queries in relational data exchange
On the Desirability of gamma-Acyclic BCNF Database Schemes
Orthogonal Range Queries in OLAP
Dynamic Complexity under Definable Changes
Structural characterizations of schema-mapping languages
Views and Decompositions of Databases from a Categorical Perspective
Processing XML Streams with Deterministic Automata
Mapping polymorphism
Structural Properties of XPath Fragments
Rewriting with Acyclic Queries: Mind Your Head
The Data Warehouse of Newsgroups
Query Languages for Neural Networks
Parallelizing the Data Cube
Definability problems for graph query languages
A theory of pricing private data
The Quest for Faster Join Algorithms (Invited Talk)
ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31 - September 2, 1988, Proceedings
Why and Where: A Characterization of Data Provenance
Work-Efficient Query Evaluation with PRAMs
Expressive Power of SQL
Axiomatizing the Logical Core of XPath 2.0
On O(N²) Equivalence Algorithm for Fan-Out Free Queries
On the Expressive Power of Query Languages for Matrices
Conjunctive Context-Free Path Queries
Discovering Frequent Closed Itemsets for Association Rules
Triejoin: A Simple, Worst-Case Optimal Join Algorithm
XPath Containment in the Presence of Disjunction, DTDs, and Variables
The Revised Gärdenfors Postulates and Update Semantics