Did you know ... | Search Documentation: |
Pack prologmud_I7 -- prolog/ec_planner/examples/Shanahan1999/Happy.txt |
# # Copyright (c) 2005 IBM Corporation and others. # All rights reserved. This program and the accompanying materials # are made available under the terms of the Common Public License v1.0 # which accompanies this distribution, and is available at # http://www.eclipse.org/legal/cpl-v10.html # # Contributors: # IBM - Initial implementation #
loading examples/Shanahan1999/Happy.e loading foundations/Root.e loading foundations/EC.e 24 variables and 46 clauses relsat solver 1 model --- model 1: 0 Hungry(Fred). 1 Happens(Feed(Fred), 1). 2 -Hungry(Fred). +Happy(Fred). P ReleasedAt(Happy(Fred), 0). ReleasedAt(Happy(Fred), 1). ReleasedAt(Happy(Fred), 2). !Happens(Clothe(Fred), 0). !Happens(Clothe(Fred), 1). !Happens(Clothe(Fred), 2). !Happens(Feed(Fred), 0). !Happens(Feed(Fred), 2). !ReleasedAt(Cold(Fred), 0). !ReleasedAt(Cold(Fred), 1). !ReleasedAt(Cold(Fred), 2). !ReleasedAt(Hungry(Fred), 0). !ReleasedAt(Hungry(Fred), 1). !ReleasedAt(Hungry(Fred), 2). EC: 7 predicates, 0 functions, 0 fluents, 0 events, 0 axioms Happy: 0 predicates, 0 functions, 3 fluents, 2 events, 6 axioms Root: 0 predicates, 0 functions, 0 fluents, 0 events, 0 axioms encoding 0.0s solution 0.0s total 0.1s Discrete Event Calculus Reasoner 1.0