Sciweavers

315 search results - page 25 / 63
» A Declarative Formalization of STRIPS
Sort
View
143
Voted
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 8 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
111
Voted
MKM
2007
Springer
15 years 7 months ago
Biform Theories in Chiron
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
William M. Farmer
ICLP
2010
Springer
15 years 4 months ago
Methods and Methodologies for Developing Answer-Set Programs - Project Description
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
EACL
2003
ACL Anthology
15 years 2 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
94
Voted
SBIA
2004
Springer
15 years 6 months ago
Towards to Similarity Identification to Help in the Agents' Negotiation
Abstract. Enterprise delegates Agents’ Negotiation is a simpler task if the enterprises involved in the transaction have homogeneous representation structures as well as the same...
Andreia Malucelli, Eugénio C. Oliveira