ICLP PROCEEDINGS OF ICLP 2018: KEYWORD INDEX
| ( | |
| (Constraint) Logic Programming | |
| A | |
| Abstract Interpretation | |
| Abstraction Refinement | |
| action language | |
| Aggregates | |
| aggregations in logic programming | |
| Animation | |
| answer set computation | |
| Answer Set Programming | |
| Apache Spark | |
| Application | |
| Approximate inference | |
| Approximation Fixpoint Theory | |
| ASP | |
| Assertions | |
| Attempto Controlled English | |
| automated guided vehicle routing | |
| B | |
| backwards analysis | |
| Benchmarking | |
| Bi-directional Grammars | |
| Bioinformatics | |
| bottom-up | |
| C | |
| car assembly operations | |
| Cautious Reasoning | |
| code generation | |
| Commonsense Reasoning | |
| Constrained Horn Clauses | |
| Constraint Handling Rules | |
| Constraint satisfaction processing | |
| Constraint Solving | |
| constraints | |
| Controlled Natural Language | |
| Controlled Natural Languages | |
| CR-Prolog2 | |
| D | |
| Data-structures | |
| Datalog | |
| Decision Modelling | |
| Declarative Algorithms | |
| dependent types | |
| distributed systems | |
| DMN | |
| Dynamic applications | |
| E | |
| efficient computation | |
| Epistemic Logic Programs | |
| epistemic specification | |
| Epistemic Specifications | |
| Equilibrium Logic | |
| Evaluable Functions | |
| Event Calculus | |
| Executable Specifications | |
| experiments | |
| Expert Systems | |
| Exposed Datapath Architectures | |
| F | |
| Finite Semantics | |
| Fixpoint Algorithms | |
| FOIL algorithm | |
| G | |
| goal-directed evaluation | |
| Grammatical Framework | |
| Graph Queries | |
| Graph Views | |
| graph-based characterization | |
| H | |
| Handwritten Digit Recognition | |
| higher-order logic programming | |
| Horn Clause Transformation | |
| Horn clauses | |
| I | |
| Incremental Analysis | |
| Incremental Maintenance | |
| Inductive Logic Programming | |
| Inductive Theorem Proving | |
| Intensional Sets | |
| intentions | |
| Intuitionistic logic | |
| L | |
| lambda calculus | |
| Likelihood weighting | |
| linear logic | |
| Linear Temporal Logic | |
| Logic of Here and There | |
| logic programming | |
| LPMLN | |
| LPOD | |
| M | |
| Machine Learning | |
| MapReduce | |
| Memory Errors | |
| Meta-Interpretive Learning | |
| Model quality | |
| Modular Analysis | |
| N | |
| natural language understanding | |
| Negation as failure | |
| Negation in Logic Programming | |
| NonMonotonic Semantics | |
| O | |
| Ontology Reasoning | |
| Optimal Scheduling | |
| P | |
| parallelism | |
| Partial Functions | |
| Phylostatic | |
| Planning | |
| precondition inference | |
| predicate | |
| preference | |
| Probabilistic graphical models | |
| Probabilistic Inductive Logic Programming | |
| Probabilistic logic programming | |
| probabilistic reasoning | |
| procedural interpretation | |
| Program Analysis | |
| program specialisation | |
| Program Verification | |
| Prolog | |
| Proof theory | |
| Proof-relevant logic | |
| proof-theoretical linear semantics | |
| Q | |
| Qualitative Reasoning | |
| Query Answering | |
| Question Answering | |
| R | |
| Re-composition | |
| Regular Datalog | |
| Resource Usage Analysis | |
| Rule-Based Systems | |
| Run-time Checks | |
| S | |
| Satisfiability Modulo Constraint Handling Rules | |
| Satisfiability Modulo Theories | |
| Search space pruning | |
| semantic parsing | |
| Sentence Planning | |
| SMT solvers | |
| Spatial Reasoning | |
| stable model | |
| stable model semantics | |
| Statistical relational learning | |
| stereotypical activities | |
| Symbolic evaluation | |
| T | |
| tabling | |
| Temporal Answer Set Programming | |
| theorem proving | |
| top-down | |
| Trajectory | |
| Type Inference | |
| V | |
| Visualization | |
| W | |
| Web services | |
| Web services composition | |
| Workflows | |
| World View Constraints | |
| World View Rules | |
| WV Facts | |