Search Results for author:
Found 13 papers, 4 papers with code
Composing Complex and Hybrid AI Solutions
Progress in several areas of computer science has been enabled by comfortable and efficient means of experimentation, clear interfaces, and interchangable components, for example using OpenCV for computer vision or ROS for robotics.
Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
Domain-specific heuristics are an important technique for solving combinatorial problems efficiently.
Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems
Humans are capable of abstracting away irrelevant details when studying problems.
Partial Compilation of ASP Programs
In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i. e., we obtain a specific binary for a given program), and might not be subject to the grounding step.
Technical Report: Adjudication of Coreference Annotations via Answer Set Optimization
We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard.
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
One of the successes of ASP is the availability of efficient systems.
Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation
The distinguishing feature of Inspire is an ASP encoding for hypothesis space generation: given a set of facts representing the mode bias, and a set of cost configuration parameters, each answer set of this encoding represents a single rule that is considered for finding a hypothesis that entails the given examples.
Improving Scalability of Inductive Logic Programming via Pruning and Best-Effort Optimisation
We focus on extending the XHAIL algorithm for ILP which is based on Answer Set Programming and we evaluate our extensions using the Natural Language Processing application of sentence chunking.
Marmara Turkish Coreference Corpus and Coreference Resolution Baseline
We describe the Marmara Turkish Coreference Corpus, which is an annotation of the whole METU-Sabanci Turkish Treebank with mentions and coreference chains.
Technical Report: Giving Hints for Logic Programming Examples without Revealing Solutions
We introduce a framework for supporting learning to program in the paradigm of Answer Set Programming (ASP), which is a declarative logic programming formalism.
Modeling Variations of First-Order Horn Abduction in Answer Set Programming
We study abduction in First Order Horn logic theories where all atoms can be abduced and we are looking for preferred solutions with respect to three objective functions: cardinality minimality, coherence, and weighted abduction.
A model building framework for Answer Set Programming with external computations
As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information in heterogeneous formats.
Levels of Integration between Low-Level Reasoning and Task Planning
We provide a systematic analysis of levels of integration between discrete high-level reasoning and continuous low-level reasoning to address hybrid planning problems in robotics.
