Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains, and answer set programming (ASP) can be achieved. Based on these results for combining hierarchical knowledge with classical rule-based formalisms, we introduce an expressive common-sense query language for formal contexts. Although this approach is conceptually based on order-theoretic paradigms, we show how it can be implemented on top of standard ASP systems. Advanced features, such as default negation and disjunctive rules, thus become practically available for processing contextual data. © Springer-Verlag Berlin Heidelberg 2006
Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the ...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
Answer set programming (ASP) is a declarative programming paradigm for the ...
Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains,...
Dealing with context-dependent knowledge has led to different formalizations of the notion of contex...
Dealing with context dependent knowledge has led to different formalizations of the notion of conte...
This survey article introduces into the essential concepts and methods underlying rule-based query l...
We live in a world, where common sense is applied almost everywhere. To apply common sense is to und...
Abstract. Answer Set Programming (ASP; [1,2,3,4]) is a declarative problem solving approach, combini...
In this paper we discuss the applicability of the knowledge representation and reasoning lan-guage A...
We integrate an expressive class of description logics (DLs) and answer set programming by extendin...
Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and pri...
Abstract. The paper is focused on a concept-based query language that permits querying by using only...
We related two formerly independent areas: Formal concept analysis and logic of domains. We will est...
In this paper, we introduce the notion “the cohe-sion with the knowledge”, and, based on it, propose...
Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the ...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
Answer set programming (ASP) is a declarative programming paradigm for the ...
Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains,...
Dealing with context-dependent knowledge has led to different formalizations of the notion of contex...
Dealing with context dependent knowledge has led to different formalizations of the notion of conte...
This survey article introduces into the essential concepts and methods underlying rule-based query l...
We live in a world, where common sense is applied almost everywhere. To apply common sense is to und...
Abstract. Answer Set Programming (ASP; [1,2,3,4]) is a declarative problem solving approach, combini...
In this paper we discuss the applicability of the knowledge representation and reasoning lan-guage A...
We integrate an expressive class of description logics (DLs) and answer set programming by extendin...
Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and pri...
Abstract. The paper is focused on a concept-based query language that permits querying by using only...
We related two formerly independent areas: Formal concept analysis and logic of domains. We will est...
In this paper, we introduce the notion “the cohe-sion with the knowledge”, and, based on it, propose...
Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the ...
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generaliz...
Answer set programming (ASP) is a declarative programming paradigm for the ...