Sciweavers

10568 search results - page 641 / 2114
» Computer Intelligence and Formalization
Sort
View
JAIR
2006
102views more  JAIR 2006»
15 years 7 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski
RAS
1998
126views more  RAS 1998»
15 years 6 months ago
Negotiation decision functions for autonomous agents
We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent for anoth...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
TOMS
2008
80views more  TOMS 2008»
15 years 6 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
RWEB
2010
Springer
15 years 5 months ago
Reasoning and Explanation in EL and in Expressive Description Logics
Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In th...
Anni-Yasmin Turhan
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
15 years 5 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft