Falco Nogatz

Falco Nogatz
Deutsches Forschungszentrum für Künstliche Intelligenz | DFKI · Smart Data & Knowledge Services

Master of Science

About

16
Publications
6,888
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
41
Citations
Additional affiliations
October 2015 - present
University of Wuerzburg
Position
  • Research Assistant
Education
April 2014 - October 2015
Ulm University
Field of study
  • Computer Science
April 2010 - March 2014
Ulm University
Field of study
  • Computer Science

Publications

Publications (16)
Preprint
The importance of coding guidelines is generally accepted throughout developers of every programming language. Naturally, Prolog makes no exception. However, establishing coding guidelines is fraught with obstacles: Finding common ground on kind and selection of rules is matter of debate; once found, adhering to or enforcing rules is complicated as...
Article
Full-text available
The importance of coding guidelines is generally accepted throughout developers of every programming language. Naturally, Prolog makes no exception. However, establishing coding guidelines is fraught with obstacles: Finding common ground on kind and selection of rules is matter of debate; once found, adhering to or enforcing rules is complicated as...
Conference Paper
Full-text available
The importance of coding guidelines is generally accepted throughout developers of every programming language. Naturally, Prolog makes no exception. However, establishing coding guidelines is fraught with obstacles: Finding common ground on kind and selection of rules is matter of debate; once found, adhering to or enforcing rules is complicated as...
Conference Paper
Definite Clause Grammars (DCGs) are a convenient way to specify possibly non-context-free grammars for natural and formal languages. They can be used to progressively build a parse tree as grammar rules are applied by providing an extra argument in the DCG rule’s head. In the simplest way, this is a structure that contains the name of the used nont...
Conference Paper
Full-text available
As with Amazon’s Echo and its conversational agent Alexa, smart voice-controlled devices become ever more present in daily life, and many different applications can be integrated into this platform. In this paper, we present a framework that eases the development of skills in Prolog. As Prolog has a long history in natural language processing, we m...
Chapter
XML Schema is a well-established mechanism to define the structure and constrain the content of an XML document. While this approach taken by itself is declarative, currently available tools for XML validation are not. In this paper we introduce an implementation of an XSD validator in SWI-Prolog, made publicly available as the package library(xsd)...
Conference Paper
Definite Clause Grammars (DCGs) are a convenient way to describe lists in Prolog. They are a common mean to specify grammars for natural language processing and to parse formal languages. Despite its long history, tools dedicated to the development and debugging of DCGs are rare. In this paper, we present an interactive, web-based tool to visualise...
Conference Paper
Constraint Handling Rules (CHR) is usually compiled to logic programming languages. While there are implementations for imperative programming languages such as C and Java, its most popular host language remains Prolog. In this paper, we present CHR.js, a CHR system implemented in JavaScript, that is suitable for both the server-side and interactiv...
Article
Declarative if–then rules have proven very useful in many applications of expert systems. They can be managed in deductive databases and evaluated using the well-known forward-chaining approach. For domain-experts, however, the syntax of rules becomes complicated quickly, and already many different knowledge representation formalisms exist. Expert...
Conference Paper
Full-text available
For representing knowledge in intelligent systems in a declarative and natural way, two major approaches have been used in the past: (1) domain-specific languages (DSLs), and (2) controlled natural languages (CNLs). Early DSLs were defined by technical and abstract syntaxes, e.g., for EBNF and regular expressions. More recently, there is a trend in...
Article
Knowledge in organization is not only represented in explicitly documented rules but also in undocumented and informal procedural rules. These implicit rules can hardly be compared with explicit rules, because they exist fragmented in different sources (e.g., individuals, groups) and cannot be collected in a standardized manner. The method introduc...
Conference Paper
Full-text available
The methods to access large relational databases in a distributed system are well established: the relational query language SQL often serves as a language for data access and manipulation, and in addition public interfaces are exposed using communication protocols like REST. Similarly to REST, GraphQL is the query protocol of an application layer...
Conference Paper
Full-text available
In this paper, we use declarative and domain–specific languages for representing expert knowledge in the field of change management in organisational psychology. Expert rules obtained in practical case studies are represented as declarative rules in a deductive database. The expert rules are annotated by information describing their provenance and...
Thesis
Full-text available
Constraint Handling Rules (CHR) is a high-level programming language extension which introduces declarative multiset semantics. Although originally designed in the early 1990s, the number of implementations is still small. While there are adaptions for popular imperative programming languages such as C and Java, its most popular host language is Pr...
Conference Paper
Full-text available
Despite its rising popularity as data format especially for web services, the software ecosystem around the JavaScript Object Notation (JSON) is not as widely distributed as that of XML. For both data formats there exist schema languages to specify the structure of instance documents, but there is currently no opportunity to translate already exist...
Thesis
Full-text available
This thesis identifies similar semantics in the two schema definition languages XML Schema and JSON Schema to build a dictionary which covers typical use cases to automatically transform first to the latter. As the range of functions of both XML Schema and JSON Schema are not identical, concrete transformation rules to reproduce similar behavior of...