VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
Abduction	TBox abduction in ALC using a DL tableau Complexity of Temporal Query Abduction in DL-Lite
ABox	Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
Absorption	Optimised Absorption for Expressive Description Logics
Abstraction refinement	Abstraction Refinement for Ontology Materialization
action languages	Planning Problems for Graph Structured Data in Description Logics
Acyclic queries	Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
ALC	Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
ALCQIO	Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
Algorithm	An ABox Revision Algorithm for the Description Logic EL_\bot
algorithms	Query Rewriting under EL TBoxes: Efficient Algorithms
alternating Turing machine	How to Best Nest Regular Path Queries
annotations	Temporalising EL Concepts with Time Intervals
Answer Set Programming	Towards Practical Deletion Repair of Inconsistent DL-programs
approximated answers	WApproximation: computing approximate answers for ontological queries
Approximations	Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
Atomic Decomposition	Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
attribute transition	Transition Constraints for Temporal Attributes
Automata-Based Reasoning	Fuzzy DLs over Finite Lattices with Nominals Gödel Description Logics with General Models
B
Bayesian networks	Bayesian Description Logics
belief change	Rational Elimination of DL-Lite TBox Axioms
belief probability	Reasoning about Belief Uncertainty in DL-Lite N bool
BioPortal	Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
bisimulation	Comparing the Expressiveness of Description Logics
Boolean circuit complexity	Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
bounded treewidth	Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
C
Combined Approach	Certain Answers in a Rough World
Comparative user evaluation	Graphol: Ontology representation through diagrams
competency question	A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
complexity	Fuzzy DLs over Finite Lattices with Nominals Complexity of Temporal Query Abduction in DL-Lite Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs Gödel Description Logics with General Models How to Best Nest Regular Path Queries Matching with respect to general concept inclusions in the Description Logic EL Analyzing the Complexity of Consistent Query Answering under Existential Rules Gödel FL_0 with Greatest Fixed-Point Semantics
complexity analysis	Bayesian Description Logics
complexity of query answering	Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics
complexity theory	Complexities of Nominal Schemas
Computational Complexity	Query Inseparability by Games Complexity sources in FDL
Concept Similarity	Mary, What's Like All Cats?
Conceptual Similarity	Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
conjunctive queries	Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics Analyzing the Complexity of Consistent Query Answering under Existential Rules
Conjunctive query answering	Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
consequence-based reasoning	Goal-Directed Tracing of Inferences in EL Ontologies Bridging the Gap between Tableau and Consequence-Based Reasoning
Consistency	Gödel Description Logics with General Models
Consistency Checking	Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract
Consistent query answering	Analyzing the Complexity of Consistent Query Answering under Existential Rules
Content representation	Shape and Content: Incorporating Domain Knowledge into Shape Analysis
Context-based Reasoning	Bayesian Description Logics
Contexts	DeaLing with Ontologies using CODs
Contextual Reasoning	Contextualized Knowledge Repositories with Justifiable Exceptions
contextualized description logics	Contextualized Knowledge Repositories with Justifiable Exceptions
contraction	Rational Elimination of DL-Lite TBox Axioms
D
Datalog	Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems Datalog Rewriting Techniques for Non-Horn Ontologies
Datalog rewritability	Datalog Rewriting Techniques for Non-Horn Ontologies
datalog rewriting	Contextualized Knowledge Repositories with Justifiable Exceptions
Datatypes	Optimised Absorption for Expressive Description Logics
defeasible inheritance	Rational closure in SHIQ
defeasible knowledge	Contextualized Knowledge Repositories with Justifiable Exceptions
defeasible reasoning	DIP: A Defeasible-Inference Platform for OWL Ontologies
dependencies	Pushing the CFDnc Envelope
Description logic	Shape and Content: Incorporating Domain Knowledge into Shape Analysis Understandable Explanations in Description Logic An ABox Revision Algorithm for the Description Logic EL_\bot Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
Description Logic Ontologies	Graphol: Ontology representation through diagrams
Description Logics	Abstraction Refinement for Ontology Materialization Reasoning about Belief Uncertainty in DL-Lite N bool TBox abduction in ALC using a DL tableau Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs Optimised Absorption for Expressive Description Logics Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes Controlled Query Evaluation over Lightweight Ontologies Datalog Rewriting Techniques for Non-Horn Ontologies Comparing the Expressiveness of Description Logics
Disjunctive Datalog	Datalog Rewriting Techniques for Non-Horn Ontologies
Disjunctive existential rules	Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
DL Lite	Reasoning about Belief Uncertainty in DL-Lite N bool
DL-Lite	Practical query answering over Hi (DL-LiteR) knowledge bases Complexity of Temporal Query Abduction in DL-Lite Temporal OBDA with LTL and DL-Lite Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics XPath for DL-Lite Ontologies Visualization and management of mappings in ontology-based data access (progress report) Instance-driven TBox Revision in DL-Lite SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment Rational Elimination of DL-Lite TBox Axioms
DL-programs	Towards Practical Deletion Repair of Inconsistent DL-programs
DL-safe rules	Complexities of Nominal Schemas
DRed	SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
E
EL	Brave and Cautious Reasoning in EL Goal-Directed Tracing of Inferences in EL Ontologies An ABox Revision Algorithm for the Description Logic EL_\bot Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs Mary, What's Like All Cats? Temporalising EL Concepts with Time Intervals Certain Answers in a Rough World
EL TBoxes	Query Rewriting under EL TBoxes: Efficient Algorithms
Error-tolerant reasoning	Brave and Cautious Reasoning in EL
evaluation	Brave and Cautious Reasoning in EL
Explanations	Understandable Explanations in Description Logic Goal-Directed Tracing of Inferences in EL Ontologies
Expressive Ontologies	OBDA Using RL Reasoners and Repairing
expressive TBoxes	Hybrid Query Answering Over DL Ontologies
expressiveness	Comparing the Expressiveness of Description Logics
F
Faceted search	On Faceted Search over Knowledge Bases
Finite Lattices	Fuzzy DLs over Finite Lattices with Nominals
Finite satisfiability and implication algorithm	Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
Finite-valued Logic	Complexity sources in FDL
fix-sized subontologies	Evaluation of Extraction Techniques for Ontology Excerpts
FL_0	Gödel FL_0 with Greatest Fixed-Point Semantics
Forgetting	Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
functional dependencies	Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
functional roles	Pushing the CFDnc Envelope
Fuzzy Description Logic	Complexity sources in FDL
Fuzzy Description Logics	Fuzzy DLs over Finite Lattices with Nominals A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB Gödel Description Logics with General Models Gödel FL_0 with Greatest Fixed-Point Semantics
Fuzzy Ontologies	A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB
G
General Models	Gödel Description Logics with General Models
Goedel T-norm	Gödel FL_0 with Greatest Fixed-Point Semantics
Graph structured data	Planning Problems for Graph Structured Data in Description Logics
Guardedness	Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
Gödel t-norm	Gödel Description Logics with General Models
H
hard subsets	An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
Higher-order description logics	Practical query answering over Hi (DL-LiteR) knowledge bases Typed Higher-Order Variant of SROIQ - Why Not?
hypergraph	Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
Hypergraphs	Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
I
identification constraints	Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
inconsistency handling	Towards Practical Deletion Repair of Inconsistent DL-programs
inconsistency-tolerant query answering	Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics
Information Hiding	Controlled Query Evaluation over Lightweight Ontologies
information retrieval	Evaluation of Extraction Techniques for Ontology Excerpts
Instance Queries	Mary, What's Like All Cats?
intervals	Temporalising EL Concepts with Time Intervals
inverse rewriting	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
J
justification	An ABox Revision Algorithm for the Description Logic EL_\bot
Justifications	Understandable Explanations in Description Logic
K
knowledge base revision	An ABox Revision Algorithm for the Description Logic EL_\bot
knowledge obfuscation	Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
L
large-scale ontologies	Brave and Cautious Reasoning in EL
lock-free data structures	Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
logical difference	Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs Evaluation of Extraction Techniques for Ontology Excerpts
M
machine learning	Predicting OWL Reasoners: Locally or Globally?
main-memory RDF store	Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
Mapping Analysis	Visualization and management of mappings in ontology-based data access (progress report)
Mapping Visualization	Visualization and management of mappings in ontology-based data access (progress report)
Matching	Matching with respect to general concept inclusions in the Description Logic EL
Materialisation	SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
Materialization	Abstraction Refinement for Ontology Materialization
meta modelling	Typed Higher-Order Variant of SROIQ - Why Not?
MinAs	Towards Parallel Repair: An Ontology Decomposition-based Approach
minimal model semantics	Rational closure in SHIQ
Minimal modules	Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
modular reasoning	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
Modularisation	Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
modularity	DeaLing with Ontologies using CODs
modules	An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
monitoring	A Stream-Temporal Query Language for Ontology Based Data Access
monotonic logic	WApproximation: computing approximate answers for ontological queries
multi-context systems	Contextualized Knowledge Repositories with Justifiable Exceptions
N
nominal schemas	Complexities of Nominal Schemas
nominals	Fuzzy DLs over Finite Lattices with Nominals
Non monotonic reasoning	DIP: A Defeasible-Inference Platform for OWL Ontologies
non-determinism	Bridging the Gap between Tableau and Consequence-Based Reasoning
non-standard reasoning	Brave and Cautious Reasoning in EL
nonmonotonic logic	WApproximation: computing approximate answers for ontological queries
nonmonotonic reasoning	Rational closure in SHIQ
normal forms	Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
O
OBDA	Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract A Stream-Temporal Query Language for Ontology Based Data Access
OBDA design tools	Visualization and management of mappings in ontology-based data access (progress report)
ontological queries	WApproximation: computing approximate answers for ontological queries
Ontologies	Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure? Controlled Query Evaluation over Lightweight Ontologies Datalog Rewriting Techniques for Non-Horn Ontologies Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
ontology	Predicting OWL Reasoners: Locally or Globally?
Ontology Based Data Access	Abstraction Refinement for Ontology Materialization XPath for DL-Lite Ontologies Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract Visualization and management of mappings in ontology-based data access (progress report)
Ontology Change	Instance-driven TBox Revision in DL-Lite
Ontology Decomposition	DeaLing with Ontologies using CODs
ontology engineering	A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
Ontology modularisation	Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
ontology modularity	Query Inseparability by Games
Ontology Repair	Towards Parallel Repair: An Ontology Decomposition-based Approach
Ontology-based data access	Hybrid Query Answering Over DL Ontologies Temporal OBDA with LTL and DL-Lite OBDA Using RL Reasoners and Repairing Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
optimisation	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
OWA and CWA	WApproximation: computing approximate answers for ontological queries
OWL	OptiqueVQS: Visual Query Formulation for OBDA On Faceted Search over Knowledge Bases DIP: A Defeasible-Inference Platform for OWL Ontologies Controlled Query Evaluation over Lightweight Ontologies
OWL 2 profiles	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
OWL 2 QL	Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
OWL 2 RL	Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
P
parallel materialisation	Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
PCA	Predicting OWL Reasoners: Locally or Globally?
performance prediction	Predicting OWL Reasoners: Locally or Globally?
planning	Planning Problems for Graph Structured Data in Description Logics
Preferential	DIP: A Defeasible-Inference Platform for OWL Ontologies
Privacy	Controlled Query Evaluation over Lightweight Ontologies
Probabilistic Description Logic	Bayesian Description Logics
probabilistic reasoning	Reasoning about Belief Uncertainty in DL-Lite N bool
Protege	DIP: A Defeasible-Inference Platform for OWL Ontologies
PTIME dialects	Pushing the CFDnc Envelope
Q
QBF	Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
query answering	Hybrid Query Answering Over DL Ontologies Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner Practical query answering over Hi (DL-LiteR) knowledge bases Query Inseparability by Games OBDA Using RL Reasoners and Repairing XPath for DL-Lite Ontologies Certain Answers in a Rough World Controlled Query Evaluation over Lightweight Ontologies Datalog Rewriting Techniques for Non-Horn Ontologies
query languages	How to Best Nest Regular Path Queries
query rewriting	Temporal OBDA with LTL and DL-Lite OBDA Using RL Reasoners and Repairing Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries Query Rewriting under EL TBoxes: Efficient Algorithms
R
rational closure	Rational closure in SHIQ
RDF	OptiqueVQS: Visual Query Formulation for OBDA On Faceted Search over Knowledge Bases
RDFS	SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
Reachability assertions	Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
reasoner	Predicting OWL Reasoners: Locally or Globally?
Reasoning	A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB OptiqueVQS: Visual Query Formulation for OBDA On Faceted Search over Knowledge Bases
regular expressions	How to Best Nest Regular Path Queries
Relaxed Queries	Mary, What's Like All Cats?
Repair Decomposition	Towards Parallel Repair: An Ontology Decomposition-based Approach
Repairing	OBDA Using RL Reasoners and Repairing
requirement traceability	A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
resolution	Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
RL systems	Hybrid Query Answering Over DL Ontologies
Rough DL	Certain Answers in a Rough World
S
Safety	A Stream-Temporal Query Language for Ontology Based Data Access
semantic knowledge	Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
Semantic tableaux	TBox abduction in ALC using a DL tableau
separation logic	Shape and Content: Incorporating Domain Knowledge into Shape Analysis
shape analysis	Shape and Content: Incorporating Domain Knowledge into Shape Analysis Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
SHOIQ	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
SHOQ	Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
similarity measures	Mary, What's Like All Cats?
simulation	Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs
SNOMED-CT	Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
SPARQL	OptiqueVQS: Visual Query Formulation for OBDA
SPARQL Update	SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
SROIQ	Typed Higher-Order Variant of SROIQ - Why Not?
Static Analysis	Planning Problems for Graph Structured Data in Description Logics
strategic interaction	Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
streams	A Stream-Temporal Query Language for Ontology Based Data Access
Succinctness	Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
System description	DIP: A Defeasible-Inference Platform for OWL Ontologies
T
Tableau Algorithm	Optimised Absorption for Expressive Description Logics
tableau reasoning	Bridging the Gap between Tableau and Consequence-Based Reasoning
TBox Revision	Instance-driven TBox Revision in DL-Lite
temporal attributes	Transition Constraints for Temporal Attributes
Temporal Description Logics	Transition Constraints for Temporal Attributes
temporal logic	Temporalising EL Concepts with Time Intervals Temporal OBDA with LTL and DL-Lite
temporal querying	Complexity of Temporal Query Abduction in DL-Lite
terminologies	Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs
time	Temporalising EL Concepts with Time Intervals
tracing	Goal-Directed Tracing of Inferences in EL Ontologies
tractability boundaries	Pushing the CFDnc Envelope
Transitive closure	How to Best Nest Regular Path Queries
tree automaton	How to Best Nest Regular Path Queries
U
uncertainty	Reasoning about Belief Uncertainty in DL-Lite N bool
unfolding	A Stream-Temporal Query Language for Ontology Based Data Access
Unification	Matching with respect to general concept inclusions in the Description Logic EL
Uniform Interpolation	Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
V
Visual Languages	Graphol: Ontology representation through diagrams
Visual query formulation	OptiqueVQS: Visual Query Formulation for OBDA
Visual query formulation interface	On Faceted Search over Knowledge Bases
X
xpath	XPath for DL-Lite Ontologies

Disclaimer | Powered by EasyChair Smart Program