Sciweavers

314 search results - page 41 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
JUCS
2006
135views more  JUCS 2006»
14 years 11 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
95
Voted
AI
2004
Springer
14 years 11 months ago
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
Ken Kaneiwa
BIRTHDAY
2005
Springer
15 years 5 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
AAAI
2004
15 years 1 months ago
Extending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
Nic Wilson
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 12 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur