FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

#
#SMT(LA)	VolCE: An Efficient Tool for Solving #SMT(LA) Problems
B
Belief Function Theory	Evidential Group Decision Making Model with Belief-Based Preferences
belief merging	Measuring Disagreement among Knowledge Bases
C
Choice Logic	A new logic for jointly representing hard and soft constraints
constraints	Evidential Group Decision Making Model with Belief-Based Preferences
Cyber Security	Leveraging Probabilistic Existential Rules for Adversarial Deduplication
D
declarative programming	A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems
Deduplication	Leveraging Probabilistic Existential Rules for Adversarial Deduplication
description logics	Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
E
Entitity Resolution	Leveraging Probabilistic Existential Rules for Adversarial Deduplication
Existential Rules	Leveraging Probabilistic Existential Rules for Adversarial Deduplication
G
Group decision	Evidential Group Decision Making Model with Belief-Based Preferences
H
Hashing-based Algorithm	A New Probabilistic Algorithm for Approximate Model Counting
I
inconsistency measures	Measuring Disagreement among Knowledge Bases
inconsistency-tolerant reasoning	Measuring Disagreement among Knowledge Bases
M
Model Counting	VolCE: An Efficient Tool for Solving #SMT(LA) Problems A New Probabilistic Algorithm for Approximate Model Counting
Model Expansion	A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems
model theory	A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems
O
Ontology Languages	Leveraging Probabilistic Existential Rules for Adversarial Deduplication
P
preference	Evidential Group Decision Making Model with Belief-Based Preferences
Preference Logic	A new logic for jointly representing hard and soft constraints
Preference Modeling	A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems
Preferential logics	Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
Probabilistic Algorithm	A New Probabilistic Algorithm for Approximate Model Counting
propositional logic	A new logic for jointly representing hard and soft constraints
R
Rational closure	Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
S
Soft constraints	Evidential Group Decision Making Model with Belief-Based Preferences
U
Uncertainty	Evidential Group Decision Making Model with Belief-Based Preferences
V
Volume Computation	VolCE: An Efficient Tool for Solving #SMT(LA) Problems
Volume Estimation	VolCE: An Efficient Tool for Solving #SMT(LA) Problems

Disclaimer | Powered by EasyChair Smart Program