FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

A
Abstract Interpretation	Towards Static Performance Guarantees for Programs with Run-time Checks An iterative approach to precondition inference using constrained Horn clauses Towards Incremental and Modular Context-sensitive Analysis
abstraction refinement	An iterative approach to precondition inference using constrained Horn clauses
action language	A Probabilistic Extension of Action Language BC+
Aggregates	Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates
aggregations in logic programming	Shared aggregate sets in answer set programming
Animation	CHRvis: Syntax and Semantics
answer set computation	MASP-Reduce: a proposal for distributed computation of stable models
Answer Set Programming	Epistemic Logic Programs with World View Constraints Specifying and Verbalising Answer Set Programs in Controlled Natural Language Temporal Answer Set Programming on Finite Traces SMT-based Answer Set Solver CMODELS(DIFF) (System Description) Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores First-order answer set programming as constructive proof search Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming Experimenting with robotic intra-logistics domains Introspecting Preferences In Answer Set Programming Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates MASP-Reduce: a proposal for distributed computation of stable models Learning Commonsense Knowledge through Interactive Dialogue Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples Shared aggregate sets in answer set programming
Apache Spark	MASP-Reduce: a proposal for distributed computation of stable models
Application	Application of Logic-Based Methods to Machine Component Design
Approximate inference	Constraint-Based Inference in Probabilistic Logic Programs
Approximation Fixpoint Theory	Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
ASP	Translating LPOD and CR-Prolog2 into Standard Answer Set Programs
Assertions	Towards Static Performance Guarantees for Programs with Run-time Checks
Attempto Controlled English	Natural Language Generation From Ontologies: Application Paper
automated guided vehicle routing	Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
B
backwards analysis	An iterative approach to precondition inference using constrained Horn clauses
Benchmarking	Experimenting with robotic intra-logistics domains
Bi-directional Grammars	Specifying and Verbalising Answer Set Programs in Controlled Natural Language
Bioinformatics	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
bottom-up	Top-down and Bottom-up Evaluation Procedurally Integrated
C
car assembly operations	Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
Cautious Reasoning	Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores
code generation	Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
Commonsense Reasoning	Learning Commonsense Knowledge through Interactive Dialogue
Constrained Horn Clauses	Solving Horn Clauses on Inductive Data Types Without Induction
Constraint Handling Rules	Shape Neutral Analysis of Graph-based Data-structures CHRvis: Syntax and Semantics A New Proof-theoretical Linear Semantics for CHR
Constraint satisfaction processing	SMT-based Answer Set Solver CMODELS(DIFF) (System Description)
Constraint Solving	Application of Logic-Based Methods to Machine Component Design
constraints	Epistemic Logic Programs with World View Constraints Constraint Answer Set Programming without Grounding Constraint-Based Inference in Probabilistic Logic Programs
Controlled Natural Language	Natural Language Generation From Ontologies: Application Paper
Controlled Natural Languages	Specifying and Verbalising Answer Set Programs in Controlled Natural Language
CR-Prolog2	Translating LPOD and CR-Prolog2 into Standard Answer Set Programs
D
Data-structures	Shape Neutral Analysis of Graph-based Data-structures
Datalog	Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability
Decision Modelling	Application of Logic-Based Methods to Machine Component Design
Declarative Algorithms	Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability
dependent types	Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis
distributed systems	MASP-Reduce: a proposal for distributed computation of stable models
DMN	Application of Logic-Based Methods to Machine Component Design
Dynamic applications	Experimenting with robotic intra-logistics domains
E
efficient computation	Shared aggregate sets in answer set programming
Epistemic Logic Programs	Epistemic Logic Programs with World View Constraints
epistemic specification	Introspecting Preferences In Answer Set Programming
Epistemic Specifications	Epistemic Logic Programs with World View Constraints
Equilibrium Logic	Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates
Evaluable Functions	Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates
Event Calculus	Learning Commonsense Knowledge through Interactive Dialogue
Executable Specifications	Specifying and Verbalising Answer Set Programs in Controlled Natural Language
Experiments	Improving Candidate Quality of Probabilistic Logic Models
Expert Systems	Application of Logic-Based Methods to Machine Component Design
Exposed Datapath Architectures	Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
F
Finite Semantics	Certified Graph View Maintenance with Regular Datalog
Fixpoint Algorithms	Towards Incremental and Modular Context-sensitive Analysis
FOIL algorithm	Cumulative Scoring-based Induction of Default Theories
G
goal-directed evaluation	Constraint Answer Set Programming without Grounding
Grammatical Framework	Natural Language Generation From Ontologies: Application Paper
Graph Queries	Certified Graph View Maintenance with Regular Datalog
Graph Views	Certified Graph View Maintenance with Regular Datalog
graph-based characterization	MASP-Reduce: a proposal for distributed computation of stable models
H
Handwritten Digit Recognition	Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples
higher-order logic programming	Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
Horn Clause Transformation	Solving Horn Clauses on Inductive Data Types Without Induction
Horn clauses	Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis
I
Incremental Analysis	Towards Incremental and Modular Context-sensitive Analysis
Incremental Maintenance	Certified Graph View Maintenance with Regular Datalog
Inductive Logic Programming	Cumulative Scoring-based Induction of Default Theories Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning Learning Commonsense Knowledge through Interactive Dialogue Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples
Inductive Theorem Proving	Solving Horn Clauses on Inductive Data Types Without Induction
Intensional Sets	Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates
intentions	An ASP Methodology for Understanding Narratives about Stereotypical Activities
Intuitionistic logic	First-order answer set programming as constructive proof search
L
lambda calculus	First-order answer set programming as constructive proof search
Likelihood weighting	Constraint-Based Inference in Probabilistic Logic Programs
linear logic	A New Proof-theoretical Linear Semantics for CHR
Linear Temporal Logic	Temporal Answer Set Programming on Finite Traces
Logic of Here and There	Temporal Answer Set Programming on Finite Traces
Logic Programming	Epistemic Logic Programs with World View Constraints Top-down and Bottom-up Evaluation Procedurally Integrated
LPMLN	A Probabilistic Extension of Action Language BC+
LPOD	Translating LPOD and CR-Prolog2 into Standard Answer Set Programs
M
Machine Learning	Cumulative Scoring-based Induction of Default Theories
MapReduce	MASP-Reduce: a proposal for distributed computation of stable models
Memory Errors	Shape Neutral Analysis of Graph-based Data-structures
Meta-Interpretive Learning	Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning
Model quality	Improving Candidate Quality of Probabilistic Logic Models
Modular Analysis	Towards Incremental and Modular Context-sensitive Analysis
N
natural language understanding	An ASP Methodology for Understanding Narratives about Stereotypical Activities
Negation as failure	Cumulative Scoring-based Induction of Default Theories
Negation in Logic Programming	Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
NonMonotonic Semantics	Declarative Algorithms in Datalog with Aggregates: user-friendly formal semantics conducive to performance and scalability
O
Ontology Reasoning	Natural Language Generation From Ontologies: Application Paper
Optimal Scheduling	Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
P
parallelism	MASP-Reduce: a proposal for distributed computation of stable models
Partial Functions	Functional ASP with Intensional Sets; Application to Gelfond-Zhang Agreggates
Phylostatic	Natural Language Generation From Ontologies: Application Paper
Planning	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
precondition inference	An iterative approach to precondition inference using constrained Horn clauses
predicate	Constraint Answer Set Programming without Grounding
preference	Introspecting Preferences In Answer Set Programming
Probabilistic graphical models	Constraint-Based Inference in Probabilistic Logic Programs
Probabilistic Inductive Logic Programming	Improving Candidate Quality of Probabilistic Logic Models
Probabilistic logic programming	Constraint-Based Inference in Probabilistic Logic Programs
probabilistic reasoning	A Probabilistic Extension of Action Language BC+
procedural interpretation	Top-down and Bottom-up Evaluation Procedurally Integrated
Program Analysis	Shape Neutral Analysis of Graph-based Data-structures Towards Incremental and Modular Context-sensitive Analysis
program specialisation	An iterative approach to precondition inference using constrained Horn clauses
Program Verification	Solving Horn Clauses on Inductive Data Types Without Induction
Prolog	Top-down and Bottom-up Evaluation Procedurally Integrated Towards Static Performance Guarantees for Programs with Run-time Checks
Proof theory	First-order answer set programming as constructive proof search
Proof-relevant logic	Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis
proof-theoretical linear semantics	A New Proof-theoretical Linear Semantics for CHR
Q
Qualitative Reasoning	A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
Query Answering	Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores
Question Answering	Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples
R
Re-composition	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
Regular Datalog	Certified Graph View Maintenance with Regular Datalog
Resource Usage Analysis	Towards Static Performance Guarantees for Programs with Run-time Checks
Rule-Based Systems	Application of Logic-Based Methods to Machine Component Design
Run-time Checks	Towards Static Performance Guarantees for Programs with Run-time Checks
S
Satisfiability Modulo Constraint Handling Rules	Shape Neutral Analysis of Graph-based Data-structures
Satisfiability Modulo Theories	Shape Neutral Analysis of Graph-based Data-structures SMT-based Answer Set Solver CMODELS(DIFF) (System Description)
Search space pruning	Improving Candidate Quality of Probabilistic Logic Models
semantic parsing	Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples
Sentence Planning	Specifying and Verbalising Answer Set Programs in Controlled Natural Language
SMT solvers	Solving Horn Clauses on Inductive Data Types Without Induction
Spatial Reasoning	A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
stable model	Constraint Answer Set Programming without Grounding
stable model semantics	First-order answer set programming as constructive proof search
Statistical relational learning	Constraint-Based Inference in Probabilistic Logic Programs
stereotypical activities	An ASP Methodology for Understanding Narratives about Stereotypical Activities
Symbolic evaluation	Constraint-Based Inference in Probabilistic Logic Programs
T
tabling	Top-down and Bottom-up Evaluation Procedurally Integrated
Temporal Answer Set Programming	Temporal Answer Set Programming on Finite Traces
theorem proving	Certified Graph View Maintenance with Regular Datalog
top-down	Top-down and Bottom-up Evaluation Procedurally Integrated
Trajectory	A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
Type Inference	Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis
V
Visualization	CHRvis: Syntax and Semantics Experimenting with robotic intra-logistics domains
W
Web services	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
Web services composition	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
Workflows	Phylotastic: An Experiment in Creating, Manipulating, and Evolving Phylogenetic Biology Workflows Using Logic Programming
World View Constraints	Epistemic Logic Programs with World View Constraints
World View Rules	Epistemic Logic Programs with World View Constraints
WV Facts	Epistemic Logic Programs with World View Constraints

Disclaimer | Powered by EasyChair Smart Program