Results 1  10
of
803,812
Logic Programming with Ordered Disjunction
 In Proceedings of AAAI02
, 2002
"... Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows ..."
Abstract

Cited by 95 (8 self)
 Add to MetaCart
Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows
Nested Logic Programs with Ordered Disjunction
"... Abstract In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LP ODs +), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPO ..."
Abstract
 Add to MetaCart
Abstract In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LP ODs +), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction
Notions of strong equivalence for logic programs with ordered disjunction
, 2008
"... Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answerset semantics, but comes in different variants, depending on the particular interpretatio ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answerset semantics, but comes in different variants, depending on the particular
Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions ∗
"... Ordered disjunctions have recently been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answerset semantics, but comes in different flavors, depending on the particular notio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Ordered disjunctions have recently been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answerset semantics, but comes in different flavors, depending on the particular
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1050 (76 self)
 Add to MetaCart
An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
The Semantics of Predicate Logic as a Programming Language
 Journal of the ACM
, 1976
"... ABSTRACT Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpomt semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational ..."
Abstract

Cited by 810 (18 self)
 Add to MetaCart
ABSTRACT Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpomt semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded
Description Logic Programs: Combining Logic Programs with Description Logic
, 2003
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 530 (45 self)
 Add to MetaCart
) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of firstorder logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDFSchema fragment of Description Logic.
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1181 (79 self)
 Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder
Results 1  10
of
803,812